


'''simple docstring'''

from graphs.minimum_spanning_tree_kruskal import kruskal





def lowerCamelCase      (      ):





	"""simple docstring"""







	__magic_name__	:   Tuple					     =					9
	__magic_name__	:   Optional[Any]					     =					[
	    [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],
	]

	__magic_name__	:   Any					     =					kruskal(lowerCAmelCase		,		lowerCAmelCase		)

	__magic_name__	:   Optional[int]					     =					[
	    [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		)



'''simple docstring'''

def lowerCamelCase      (      lowerCAmelCase    :     str		):





	"""simple docstring"""







	return "".join(chr(ord(lowerCAmelCase		) - 32		) if 'a' <= char <= 'z' else char for char in word		)


if __name__ == "__main__":
							from doctest import testmod

							testmod()