




def  a_		(							__snake_case					)	->			tuple[int, int]:

			'''simple docstring'''


			if len(__snake_case					) == 1:
						return a[0], a[0]
			else:
						# split A into half.
						UpperCamelCase_     				= a[: len(__snake_case					) // 2]
						UpperCamelCase_     				= a[len(__snake_case					) // 2 :]

						# 2 sub problems, 1/2 of original size.
						UpperCamelCase_				,   UpperCamelCase_     				= max_difference(__snake_case					)
						UpperCamelCase_				,   UpperCamelCase_     				= max_difference(__snake_case					)

						# get min of first and max of second
						# linear time
						UpperCamelCase_     				= min(__snake_case					)
						UpperCamelCase_     				= max(__snake_case					)

						# 3 cases, either (small1, big1),
						# (min_first, max_second), (small2, big2)
						# constant comparisons
						if biga - smalla > max_second - min_first and biga - smalla > biga - smalla:
									return smalla, biga
						elif biga - smalla > max_second - min_first:
									return smalla, biga
						else:
									return min_first, max_second


if __name__ == "__main__":
				import doctest

				doctest.testmod()






from collections import Counter




def  a_		(							__snake_case					)	->			int:

			'''simple docstring'''


			return sum(socks_by_color // 2 for socks_by_color in Counter(__snake_case					).values()					)


if __name__ == "__main__":
				import doctest

				doctest.testmod()

				__a			:	List[Any]							     =		[int(x) for x in input("""Enter socks by color :""").rstrip().split()]
				print(f"""sock_merchant({colors}) = {sock_merchant(colors)}""")
