




def 							_A       (						lowerCAmelCase_					: int = 1000      ) ->    Optional[int]:
     """simple docstring"""

     lowerCAmelCase__          =			-1
     lowerCAmelCase__          =			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
          lowerCAmelCase__          =			(n * n - 2 * a * n) // (2 * n - 2 * a)
          lowerCAmelCase__          =			n - a - b
          if c * c == (a * a + b * b):
               lowerCAmelCase__          =			a * b * c
               if candidate >= product:
                    lowerCAmelCase__          =			candidate
     return product


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






def 							_A       (						lowerCAmelCase_					: int = 1000      ):
     """simple docstring"""

     return sum(2 * a * ((a - 1) // 2) for a in range(3       ,    n + 1      )      )


if __name__ == "__main__":
     print(solution())
