





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

					lowerCamelCase__       =       sorted(string.lower())
					return len(a) == len(set(a))


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

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








A_												=     {str(digit): digit**5 for digit in range(1_0)}





def    __UpperCamelCase      (    a) ->int:
					return sum(DIGITS_FIFTH_POWER[digit] for digit in str(a))





def    __UpperCamelCase      (    ) ->int:
					return sum(
					    number
					    for number in range(1000,     1000000)
					    if number == digits_fifth_powers_sum(a))


if __name__ == "__main__":
						print(solution())

