

'''simple docstring'''

def 							_UpperCamelCase				(   lowerCAmelCase__:					List[str]		,lowerCAmelCase__:					List[str]		,lowerCAmelCase__:					Dict   )      -> List[Any]:
							if n == 0:
														return 1

							elif n % 2 == 1:
														return (binary_exponentiation(__lowerCAmelCase		,n - 1		,__lowerCAmelCase   ) * a) % mod

							else:
														SCREAMING_SNAKE_CASE_				=				binary_exponentiation(__lowerCAmelCase		,n / 2		,__lowerCAmelCase   )
														return (b * b) % mod


# a prime number
SCREAMING_SNAKE_CASE							:				Union[str, Any]     	=			701

SCREAMING_SNAKE_CASE							:				Tuple     	=			1000000000
SCREAMING_SNAKE_CASE							:				Optional[int]     	=			10

# using binary exponentiation function, O(log(p)):
print((a / b) % p == (a * binary_exponentiation(b, p - 2, p)) % p)




print((a / b) % p == (a * b ** (p - 2)) % p)













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

   __UpperCamelCase	:			List[str]					=					sorted(string.lower()							)
   return len(__lowerCAmelCase							) == len(set(__lowerCAmelCase							)							)


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

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



