

import itertools
import math

def 	__snake_case		(      __UpperCamelCase     :      int  ):



      """simple docstring"""

      if 1 < number < 4:
            # 2 and 3 are primes
            return True
      elif number < 2 or number % 2 == 0 or number % 3 == 0:
            # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
            return False

      # All primes number are in format of 6k +/- 1
      for i in range(5							,int(math.sqrt(A_  ) + 1  )							,6  ):
            if number % i == 0 or number % (i + 2) == 0:
                  return False
      return True

def 	__snake_case		(      ):



      """simple docstring"""

      A_		   =							2
      while True:
            if is_prime(A_  ):
                  yield num
            num += 1

def 	__snake_case		(      __UpperCamelCase     :      Dict = 1_0001  ):



      """simple docstring"""

      return next(itertools.islice(prime_generator()							,nth - 1							,A_  )  )


if __name__ == "__main__":
      print(F"{solution() = }")



"""simple docstring"""







def      lowercase			(				A_       )->      bool:
  '''simple docstring'''







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

  a						:		Tuple      							=			sorted(string.lower()       )
  return len(A_       ) == len(set(A_       )       )


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

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






