


"""simple docstring"""







def      lowercase			(				A_ = 200       )->      int:
  '''simple docstring'''







  a						:		Union[str, Any]      							=			[1, 2, 5, 10, 20, 50, 100, 200]
  a						:		Optional[int]      							=			[0] * (pence + 1)
  a						:		Tuple      							=			1  # base case: 1 way to make 0 pence

  for coin in coins:
    for i in range(A_  ,   pence + 1  ,   1       ):
      number_of_ways[i] += number_of_ways[i - coin]
  return number_of_ways[pence]


if __name__ == "__main__":
 assert solution(200) == 73682










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






