
"""simple docstring"""





def 			__a  (	):

   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 			__a  (	):

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

   return -1







def 			__a  (	):
   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"""





from .hash_table import HashTable


class A_			(lowercase__   ):




  '''simple docstring'''







  def __init__(	self       ,     *lowercase_       ,     **lowercase_						):

     """simple docstring"""
     super().__init__(*lowercase_       ,     **lowercase_						)







  def  UpperCamelCase__      (	self       ,     lowercase_       ,     lowercase_=None						):

     """simple docstring"""
     UpperCAmelCase_      :      Tuple      =					1
     UpperCAmelCase_      :      List[str]      =					self.hash_function(key + i * i						)

     while self.values[new_key] is not None and self.values[new_key] != key:
        i += 1
        UpperCAmelCase_      :      List[Any]      =					(
            self.hash_function(key + i * i						)
            if not self.balanced_factor() >= self.lim_charge
            else None
        )

        if new_key is None:
           break

     return new_key


