'''simple docstring'''





def 			A__      (	):
 return [
     a * b * (1_000 - a - b)
     for a in range(1       ,				999      )
     for b in range(snake_case_       ,				999      )
     if (a * a + b * b == (1_000 - a - b) ** 2)
 ][0]


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


from ..utils import DummyObject, requires_backends






class 		_lowerCamelCase		(   metaclass=UpperCamelCase_    ):
    __a  =      ["torch", "scipy"]
    def __init__(  self , *lowerCAmelCase , **lowerCAmelCase   )       ->					Any:
     requires_backends(self , ['''torch''', '''scipy''']   )
    @classmethod
    def 						UpperCamelCase_				(  cls , *lowerCAmelCase , **lowerCAmelCase   )       ->					List[str]:
     requires_backends(cls , ['''torch''', '''scipy''']   )



    @classmethod
    def 						UpperCamelCase_				(  cls , *lowerCAmelCase , **lowerCAmelCase   )       ->					Tuple:
     requires_backends(cls , ['''torch''', '''scipy''']   )

