


from __future__ import annotations

from functools import lru_cache
from math import ceil

__snake_case   							=						1_0_0

__snake_case   							=						set(range(3, NUM_PRIMES, 2))
primes.add(2)
__snake_case   							=						42

for prime in range(3, ceil(NUM_PRIMES**0.5), 2):
    if prime not in primes:
        continue
    primes.difference_update(set(range(prime * prime, NUM_PRIMES, prime)))






@lru_cache(maxsize=1_00 )
def 		_A		(		_lowercase )					-> set[int]:


     """simple docstring"""


     if number_to_partition < 0:
          return set()
     elif number_to_partition == 0:
          return {1}

     __UpperCamelCase =			set()
     __UpperCamelCase =			42
     __UpperCamelCase =			42

     for prime in primes:
          if prime > number_to_partition:
               continue
          for sub in partition(number_to_partition - prime ):
               ret.add(sub * prime )

     return ret






def 		_A		(		_lowercase = 50_00 )					-> int | None:


     """simple docstring"""


     for number_to_partition in range(1					,  _lowercase ):
          if len(partition(_lowercase ) ) > number_unique_partitions:
               return number_to_partition
     return None


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

