

from math import sqrt

def 	snake_case__			(    SCREAMING_SNAKE_CASE_		:    int			):



     '''simple docstring'''





     lowercase__    :   List[str]      =       0
     for i in range(1	,     int(sqrt(SCREAMING_SNAKE_CASE_			) + 1			)			):
          if n % i == 0 and i != sqrt(SCREAMING_SNAKE_CASE_			):
               total += i + n // i
          elif i == sqrt(SCREAMING_SNAKE_CASE_			):
               total += i
     return total - n

def 	snake_case__			(    SCREAMING_SNAKE_CASE_		:    int = 10_000			):



     '''simple docstring'''





     lowercase__    :   Union[str, Any]      =       sum(
         i
         for i in range(1	,     SCREAMING_SNAKE_CASE_			)
         if sum_of_divisors(sum_of_divisors(SCREAMING_SNAKE_CASE_			)			) == i and sum_of_divisors(SCREAMING_SNAKE_CASE_			) != i			)
     return total


if __name__ == "__main__":
       print(solution(int(str(input()).strip())))




def 	snake_case__			(    SCREAMING_SNAKE_CASE_		:    str			):



     '''simple docstring'''





     if not all(x.isalpha() for x in string			):
          raise ValueError('String must only contain alphabetic characters.'			)

     lowercase__    :   Optional[int]      =       sorted(string.lower()			)
     return len(SCREAMING_SNAKE_CASE_			) == len(set(SCREAMING_SNAKE_CASE_			)			)


if __name__ == "__main__":
       snake_case_			  = input('''Enter a string ''').strip()

       snake_case_			  = is_isogram(input_str)
       print(F'''{input_str} is {'an' if isogram else 'not an'} isogram.''')

