




def  lowerCAmelCase  (	)  ->int:






					"""simple docstring"""






					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  lowerCAmelCase  (	)  ->int:






					"""simple docstring"""






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

					return -1







def  lowerCAmelCase  (	)  ->None:






					"""simple docstring"""






					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() = }")










"""simple docstring"""
__UpperCamelCase			:		Tuple		    =   10**8

def 						_SCREAMING_SNAKE_CASE       (_UpperCAmelCase :  int       ):
 if n % 10 == 0:
  return False
 lowerCAmelCase  							=      str(_UpperCAmelCase       )
 return s == s[::-1]

def 						_SCREAMING_SNAKE_CASE       ():
 lowerCAmelCase  							=      set()
 lowerCAmelCase  							=      1
 lowerCAmelCase  							=      5
 while sum_squares < LIMIT:
  lowerCAmelCase  							=      first_square + 1
  while sum_squares < LIMIT:
   if is_palindrome(_UpperCAmelCase       ):
    answer.add(_UpperCAmelCase       )
   last_square += 1
   sum_squares += last_square**2
  first_square += 1
  lowerCAmelCase  							=      first_square**2 + (first_square + 1) ** 2

 return sum(_UpperCAmelCase       )


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





