"""simple docstring"""
import math
from collections.abc import Iterator
from itertools import takewhile



def 					UpperCamelCase					(       SCREAMING_SNAKE_CASE_ )      ->Optional[int]:

    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(SCREAMING_SNAKE_CASE_ ) + 1 )						,	6 ):
        if number % i == 0 or number % (i + 2) == 0:
            return False
    return True



def 					UpperCamelCase					(       )      ->Any:
    _lowerCamelCase	: Optional[Any]       =       2
    while True:
        if is_prime(SCREAMING_SNAKE_CASE_ ):
            yield num
        num += 1



def 					UpperCamelCase					(       SCREAMING_SNAKE_CASE_ = 200_0000 )      ->List[str]:
    return sum(takewhile(lambda SCREAMING_SNAKE_CASE_ : x < n						,	prime_generator() ) )


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








'''simple docstring'''


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

						__snake_case						 =   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.''')

