
def     UpperCamelCase      (					):

       for a in range(300					):
              for b in range(a + 1       ,      400					):
                     for c in range(b + 1       ,      500					):
                            if (a + b + c) == 1000 and (a**2) + (b**2) == (c**2):
                                   return a * b * c

       return -1


def     UpperCamelCase      (					):

       for a in range(300					):
              for b in range(400					):
                     snake_case :     Optional[int]           =   1000 - a - b
                     if a < b < c and (a**2) + (b**2) == (c**2):
                            return a * b * c

       return -1


def     UpperCamelCase      (					):
       import timeit

       print(
           timeit.timeit("solution()"       ,      setup="from __main__ import solution"       ,      number=1000					)					)
       print(
           timeit.timeit(
               "solution_fast()"       ,      setup="from __main__ import solution_fast"       ,      number=1000					)					)


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







def     UpperCamelCase      (					__lowerCamelCase  :				int = 998001					):
       snake_case :     Optional[Any]           =   0
       for i in range(999       ,      99       ,      -1					):  # 3 digit numbers range from 999 down to 100
              for j in range(999       ,      99       ,      -1					):
                     snake_case :     Tuple           =   str(i * j					)
                     if product_string == product_string[::-1] and i * j < n:
                            snake_case :     str           =   max(__lowerCamelCase       ,      i * j					)
       return answer


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





