






from __future__ import annotations

import typing
from collections import Counter






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






def     _snake_case    (__lowercase = 1000):
			UpperCamelCase_									=     pythagorean_triple(__lowercase)
			return triplets.most_common(1)[0][0]


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













def     _snake_case    (__lowercase = 1000):
   UpperCamelCase_		,      UpperCamelCase_									=     1, 1
   UpperCamelCase_									=     2
   while True:
      UpperCamelCase_									=     0
      UpperCamelCase_									=     fa + fa
      UpperCamelCase_		,      UpperCamelCase_									=     fa, f
      index += 1
      for _ in str(__lowercase):
         i += 1
      if i == n:
         break
   return index


if __name__ == "__main__":
 print(solution(int(str(input()).strip())))





