





"""simple docstring"""
def      __lowerCamelCase   (							)			->      int:
      return [
          a * b * (10_00 - a - b)
          for a in range(1 ,   9_99							)
          for b in range(a_ ,   9_99							)
          if (a * a + b * b == (10_00 - a - b) ** 2)
      ][0]


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






"""simple docstring"""
from typing import Any



def      __lowerCamelCase   (							a_     :		list							)			->      list[Any]:
      if not input_list:
            return []
      __SCREAMING_SNAKE_CASE   :int						=  [input_list.count(a_							) for value in input_list]
      __SCREAMING_SNAKE_CASE   :str						=  max(a_							)  # Gets the maximum count in the input list.
      # Gets values of modes
      return sorted({input_list[i] for i, value in enumerate(a_							) if value == y}							)


if __name__ == "__main__":
  import doctest

  doctest.testmod()