



def        lowercase_							():
       return [
           a * b * (1_0_0_0 - a - b)
           for a in range(1		,					9_9_9      )
           for b in range(A		,					9_9_9      )
           if (a * a + b * b == (1_0_0_0 - a - b) ** 2)
       ][0]


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











from collections import deque

from .hash_table import HashTable




class 					snake_case__						(       lowerCAmelCase_     ):






     """simple docstring"""


     def __init__(       self  :  Optional[Any], *_snake_case  :  Optional[Any], **_snake_case  :  List[Any]					)   ->Optional[int]:
            super().__init__(*_snake_case, **_snake_case					)






     def    lowercase_   (       self  :  Optional[Any], _snake_case  :  Tuple, _snake_case  :  Dict					)   ->Dict:
            snake_case__							:	int   	=	deque([]					) if self.values[key] is None else self.values[key]
            self.values[key].appendleft(_snake_case					)
            snake_case__							:	Dict   	=	self.values[key]






     def    lowercase_   (       self  :  Any					)   ->Optional[Any]:
            return (
                sum(self.charge_factor - len(_snake_case					) for slot in self.values					)
                / self.size_table
                * self.charge_factor
            )






     def    lowercase_   (       self  :  Union[str, Any], _snake_case  :  str, _snake_case  :  Optional[int]=None					)   ->Optional[Any]:
            if not (
                len(self.values[key]					) == self.charge_factor and self.values.count(_snake_case					) == 0
            ):
                   return key
            return super()._collision_resolution(_snake_case, _snake_case					)






