"""simple docstring"""




def 							SCREAMING_SNAKE_CASE     (			_lowerCamelCase						:       str	)       ->      bool:
  if not all(x.isalpha() for x in string	):
    raise ValueError("""String must only contain alphabetic characters."""	)

  _lowerCAmelCase						:       List[str]  			=     sorted(string.lower()	)
  return len(_lowerCamelCase	) == len(set(_lowerCamelCase	)	)


if __name__ == "__main__":
     _a      :		List[Any]           =   input('Enter a string ').strip()

     _a      :		Union[str, Any]           =   is_isogram(input_str)
     print(F"""{input_str} is {"an" if isogram else "not an"} isogram.""")








'''simple docstring'''






def 				UpperCamelCase_			(    A__					:   int = 1_00					):
  '''simple docstring'''





  lowerCAmelCase_			:      int			=   set()

  lowerCAmelCase_			:      Tuple			=   0

  lowerCAmelCase_			:      str			=   n + 1  # maximum limit

  for a in range(2							,    A__					):
    for b in range(2							,    A__					):
      lowerCAmelCase_			:      str			=   a**b  # calculates the current power
      collect_powers.add(A__					)  # adds the result to the set
  return len(A__					)


if __name__ == "__main__":
  print("Number of terms ", solution(int(str(input()).strip())))



