





def     lowerCamelCase__  (  UpperCamelCase__      :							int							,     UpperCamelCase__      :							list[tuple[int, int, int]]    )      ->			list[tuple[int, int, int]]:



					'''simple docstring'''




					_snake_case						=					sorted(UpperCamelCase__							,     key=lambda UpperCamelCase__    : edge[2]    )

					_snake_case						=					list(range(UpperCamelCase__    )    )

					def find_parent(UpperCamelCase__      :							Tuple    ):
										if i != parent[i]:
															_snake_case						=					find_parent(parent[i]    )
										return parent[i]

					_snake_case						=					0
					_snake_case						=					[]

					for edge in edges:
										_snake_case						=					find_parent(edge[0]    )
										_snake_case						=					find_parent(edge[1]    )
										if parent_a != parent_b:
															minimum_spanning_tree_cost += edge[2]
															minimum_spanning_tree.append(UpperCamelCase__    )
															_snake_case						=					parent_b

					return minimum_spanning_tree


if __name__ == "__main__":  # pragma: no cover
					UpperCAmelCase_				,   UpperCAmelCase_   				=  list(map(int, input().strip().split()))
					UpperCAmelCase_   				=  []

					for _ in range(num_edges):
										UpperCAmelCase_				,   UpperCAmelCase_				,   UpperCAmelCase_   				=  (int(x) for x in input().strip().split())
										edges.append((nodea, nodea, cost))

					kruskal(num_nodes, edges)










def     lowerCamelCase__  (  UpperCamelCase__      :							int = 100    )      ->			int:



					'''simple docstring'''




					_snake_case						=					1
					_snake_case						=					0
					for i in range(1							,     num + 1    ):
										fact *= i

					for j in str(UpperCamelCase__    ):
										result += int(UpperCamelCase__    )

					return result


if __name__ == "__main__":
					print(solution(int(input("""Enter the Number: """).strip())))



