





"""simple docstring"""


from graphs.minimum_spanning_tree_kruskal import kruskal

def      UpperCamelCase							():
						UpperCamelCase				:		Union[str, Any]				   =			9
						UpperCamelCase				:		int				   =			[
						    [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],
						]

						UpperCamelCase				:		str				   =			kruskal(SCREAMING_SNAKE_CASE							,     SCREAMING_SNAKE_CASE     )

						UpperCamelCase				:		str				   =			[
						    [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(SCREAMING_SNAKE_CASE     ) == sorted(SCREAMING_SNAKE_CASE     )










"""simple docstring"""


import os

def      UpperCamelCase							():
						UpperCamelCase				:		Union[str, Any]				   =			os.path.join(os.path.dirname(SCREAMING_SNAKE_CASE     )							,     """num.txt"""     )
						with open(SCREAMING_SNAKE_CASE     ) as file_hand:
												return str(sum(int(SCREAMING_SNAKE_CASE     ) for line in file_hand     )     )[:10]


if __name__ == "__main__":
		print(solution())



