




'''simple docstring'''



from __future__ import annotations

import typing
from collections import Counter
def 			SCREAMING_SNAKE_CASE_			(							__A    :			int  )			->			typing.Counter[int]:
   _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 			SCREAMING_SNAKE_CASE_			(							__A    :			int = 10_00  )			->			int:
   _SCREAMING_SNAKE_CASE	=				pythagorean_triple(__A  )
   return triplets.most_common(1  )[0][0]


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







'''simple docstring'''



def 			SCREAMING_SNAKE_CASE_			(							__A    :			int  )			->			int:
   if n == 1 or not isinstance(__A	,					__A  ):
      return 0
   elif n == 2:
      return 1
   else:
      _SCREAMING_SNAKE_CASE	=				[0, 1]
      for i in range(2	,					n + 1  ):
         sequence.append(sequence[i - 1] + sequence[i - 2]  )

      return sequence[n]
def 			SCREAMING_SNAKE_CASE_			(							__A    :			int  )			->			int:
   _SCREAMING_SNAKE_CASE	=				0
   _SCREAMING_SNAKE_CASE	=				2

   while digits < n:
      index += 1
      _SCREAMING_SNAKE_CASE	=				len(str(fibonacci(__A  )  )  )

   return index
def 			SCREAMING_SNAKE_CASE_			(							__A    :			int = 10_00  )			->			int:
   return fibonacci_digits_index(__A  )


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

