




def lowerCamelCase__  (     _lowercase					,		_lowercase ):

     '''simple docstring'''


     UpperCAmelCase_     :				Dict  =     [0 for i in range(r + 1 )]
     # nc0 = 1
     UpperCAmelCase_     :				int  =     1
     for i in range(1					,		n + 1 ):
          # to compute current row from previous row.
          UpperCAmelCase_     :				Union[str, Any]  =     min(_lowercase					,		_lowercase )
          while j > 0:
               c[j] += c[j - 1]
               j -= 1
     return c[r]



print(binomial_coefficient(n=10, r=5))




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

   __lowerCamelCase    				=     sorted(string.lower()				)
   return len(_UpperCamelCase				) == len(set(_UpperCamelCase				)				)


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






