





from __future__ import annotations

import typing
from collections import Counter


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


def     SCREAMING_SNAKE_CASE			(      lowerCAmelCase = 1_000					):
       _UpperCamelCase              =						pythagorean_triple(lowerCAmelCase					)
       return triplets.most_common(1					)[0][0]


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













from math import factorial


def     SCREAMING_SNAKE_CASE			(      lowerCAmelCase = 20					):
       _UpperCamelCase              =						2 * n  # middle entry of odd rows starting at row 3 is the solution for n = 1,
       # 2, 3,...
       _UpperCamelCase              =						n // 2

       return int(factorial(lowerCAmelCase					) / (factorial(lowerCAmelCase					) * factorial(n - k					))					)


if __name__ == "__main__":
       import sys

       if len(sys.argv) == 1:
              print(solution(20))
       else:
              try:
                     lowercase    : Dict    	=  int(sys.argv[1])
                     print(solution(n))
              except ValueError:
                     print("""Invalid entry - please enter a number.""")






