



from __future__ import annotations



class 			__lowerCAmelCase  :




 def __init__(    self						,					__UpperCAmelCase=None					):



    '''simple docstring'''
    __lowerCamelCase    				=     data
    __lowerCamelCase    				=     None




 def __repr__(    self					):



    '''simple docstring'''
    __lowerCamelCase    				=     []
    __lowerCamelCase    				=     self
    while temp:
       string_rep.append(F"""{temp.data}"""					)
       __lowerCamelCase    				=     temp.next
    return "->".join(__UpperCAmelCase					)





def 		a__      (		_UpperCamelCase      :			list				):
   if not elements_list:
      raise Exception('''The Elements List is empty'''				)

   __lowerCamelCase    				=     __lowerCamelCase    				=     Node(elements_list[0]				)
   for i in range(1			,len(_UpperCamelCase				)				):
      __lowerCamelCase    				=     Node(elements_list[i]				)
      __lowerCamelCase    				=     current.next
   return head





def 		a__      (		_UpperCamelCase      :			Node				):
   if head_node is not None and isinstance(_UpperCamelCase			,_UpperCamelCase				):
      print_reverse(head_node.next				)
      print(head_node.data				)





def 		a__      (		):
   from doctest import testmod

   testmod()

   __lowerCamelCase    				=     make_linked_list([14, 52, 14, 12, 43]				)
   print('''Linked List:'''				)
   print(_UpperCamelCase				)
   print('''Elements in Reverse:'''				)
   print_reverse(_UpperCamelCase				)


if __name__ == "__main__":
  main()











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






