




"""simple docstring"""




def        _lowerCamelCase ( __a    ):
		SCREAMING_SNAKE_CASE_ ,SCREAMING_SNAKE_CASE_						 = [], []
		while len(_UpperCamelCase    ) > 1:
				SCREAMING_SNAKE_CASE_ ,SCREAMING_SNAKE_CASE_						 = min(_UpperCamelCase    ), max(_UpperCamelCase    )
				start.append(_UpperCamelCase    )
				end.append(_UpperCamelCase    )
				collection.remove(_UpperCamelCase    )
				collection.remove(_UpperCamelCase    )
		end.reverse()
		return start + collection + end


if __name__ == "__main__":
						lowerCAmelCase__							=				input('Enter numbers separated by a comma:\n').strip()
						lowerCAmelCase__							=				[int(item) for item in user_input.split(',')]
						print(*merge_sort(unsorted), sep=',')

"""simple docstring"""




from __future__ import annotations

import typing
from collections import Counter



def        _lowerCamelCase ( __a    ):
		SCREAMING_SNAKE_CASE_						 = Counter()
		for base in range(1,							max_perimeter + 1    ):
				for perpendicular in range(__a,							max_perimeter + 1    ):
						SCREAMING_SNAKE_CASE_						 = (base * base + perpendicular * perpendicular) ** 0.5
						if hypotenuse == int(__a    ):
								SCREAMING_SNAKE_CASE_						 = int(base + perpendicular + hypotenuse    )
								if perimeter > max_perimeter:
										continue
								triplets[perimeter] += 1
		return triplets



def        _lowerCamelCase ( __a = 1_000    ):
		SCREAMING_SNAKE_CASE_						 = pythagorean_triple(__a    )
		return triplets.most_common(1    )[0][0]


if __name__ == "__main__":
						print(f'''Perimeter {solution()} has maximum solutions''')