def       A__   (						snake_case_			:		int = 1_000   ):
 SCREAMING_SNAKE_CASE__: Optional[int]=   -1
 SCREAMING_SNAKE_CASE__: Optional[Any]=   0
 for a in range(1							,					n // 3   ):
  # Solving the two equations a**2+b**2=c**2 and a+b+c=N eliminating c
  SCREAMING_SNAKE_CASE__: Dict=   (n * n - 2 * a * n) // (2 * n - 2 * a)
  SCREAMING_SNAKE_CASE__: str=   n - a - b
  if c * c == (a * a + b * b):
   SCREAMING_SNAKE_CASE__: List[Any]=   a * b * c
   if candidate >= product:
    SCREAMING_SNAKE_CASE__: Union[str, Any]=   candidate
 return product


if __name__ == "__main__":
      print(f'''{solution() = }''')





'''simple docstring'''






def    _snake_case  (	A					,       A			)		->       int:
							return x if y == 0 else greatest_common_divisor(A					,       x % y			)


def    _snake_case  (	A					,       A			)		->       int:
							return (x * y) // greatest_common_divisor(A					,       A			)


def    _snake_case  (	A = 20			)		->       int:
							lowerCAmelCase__			  =      1
							for i in range(1					,       n + 1			):
														lowerCAmelCase__			  =      lcm(A					,       A			)
							return g


if __name__ == "__main__":
		print(f"""{solution() = }""")