
def 						A_			(				snake_case				: int			,   snake_case				: list[tuple[int, int, int]]			)   ->     list[tuple[int, int, int]]:



						'''simple docstring'''

						__UpperCamelCase  	=      sorted(snake_case			,   key=lambda snake_case			: edge[2]			)

						__UpperCamelCase  	=      list(range(snake_case			)			)

						def find_parent(snake_case				: Dict			):
												if i != parent[i]:
																		__UpperCamelCase  	=      find_parent(parent[i]			)
												return parent[i]

						__UpperCamelCase  	=      0
						__UpperCamelCase  	=      []

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

						return minimum_spanning_tree


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

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

				kruskal(num_nodes, edges)





"""simple docstring"""







from collections import Counter



def       A__    (	lowercase_     :	list[int]						)  ->							int:
   return sum(socks_by_color // 2 for socks_by_color in Counter(lowercase_						).values()						)


if __name__ == "__main__":
     import doctest

     doctest.testmod()

     _SCREAMING_SNAKE_CASE	:		int   =   [int(x) for x in input('''Enter socks by color :''').rstrip().split()]
     print(F"sock_merchant({colors}) = {sock_merchant(colors)}")






