

'''simple docstring'''

from graphs.minimum_spanning_tree_kruskal import kruskal

def 					__UpperCamelCase				(						):






     '''simple docstring'''





     __lowercase      		=9
     __lowercase      		=[
         [0, 1, 4],
         [0, 7, 8],
         [1, 2, 8],
         [7, 8, 7],
         [7, 6, 1],
         [2, 8, 2],
         [8, 6, 6],
         [2, 3, 7],
         [2, 5, 4],
         [6, 5, 2],
         [3, 5, 14],
         [3, 4, 9],
         [5, 4, 10],
         [1, 7, 11],
     ]

     __lowercase      		=kruskal(_lowerCAmelCase,       _lowerCAmelCase			)

     __lowercase      		=[
         [7, 6, 1],
         [2, 8, 2],
         [6, 5, 2],
         [0, 1, 4],
         [2, 5, 4],
         [2, 3, 7],
         [0, 7, 8],
         [3, 4, 9],
     ]

     assert sorted(_lowerCAmelCase			) == sorted(_lowerCAmelCase			)









def 						A_							(	_lowerCAmelCase	)		->					bool:
 UpperCamelCase      :   List[Any]			      =  0
 for ch in input_str:
  UpperCamelCase      :   Optional[Any]			      =  ord(_lowerCAmelCase	)
  UpperCamelCase      :   Optional[Any]			      =  pow(2				,  _lowerCAmelCase	)

  # If we already turned on bit for current character's unicode
  if bitmap >> ch_unicode & 1 == 1:
   return False
  bitmap |= ch_bit_index_on
 return True


if __name__ == "__main__":
    import doctest

    doctest.testmod()
