


from __future__ import annotations

import typing
from collections import Counter





def __UpperCAmelCase       (		__A			)						->					typing.Counter[int]:



       '''simple docstring'''





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





def __UpperCAmelCase       (		__A = 1_0_0_0			)						->					int:



       '''simple docstring'''





       UpperCAmelCase__										=     pythagorean_triple(__A			)
       return triplets.most_common(1			)[0][0]


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









def __UpperCAmelCase       (		__A			)						->					list[int]:



       '''simple docstring'''





       UpperCAmelCase__										=     len(__A			)
       for i in range(__A			):
              for j in range(i + 1 ,						__A			):
                     if numbers[j] < numbers[i]:
                            UpperCAmelCase__						,			UpperCAmelCase__										=     numbers[j], numbers[i]
       return numbers


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





