def 					_snake_case	(  ):
					return [
					    a * b * (1000 - a - b)
					    for a in range(1  ,     999						)
					    for b in range(__snake_case  ,     999						)
					    if (a * a + b * b == (1000 - a - b) ** 2)
					][0]


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








def       _SCREAMING_SNAKE_CASE    (			__lowercase :      List[Any]     )    ->   Any:





    """simple docstring"""

    stooge(__lowercase      ,					0      ,					len(__lowercase     ) - 1     )
    return arr



def       _SCREAMING_SNAKE_CASE    (			__lowercase :      str      ,					__lowercase :      Dict      ,					__lowercase :      Dict     )    ->   int:





    """simple docstring"""

    if i >= h:
        return

    # If first element is smaller than the last then swap them
    if arr[i] > arr[h]:
        __A     ,						__A       =						arr[h], arr[i]

    # If there are more than 2 elements in the array
    if h - i + 1 > 2:
        __A       =						(int)((h - i + 1) / 3     )

        # Recursively sort first 2/3 elements
        stooge(__lowercase      ,					__lowercase      ,					(h - t)     )

        # Recursively sort last 2/3 elements
        stooge(__lowercase      ,					i + t      ,					(__lowercase)     )

        # Recursively sort first 2/3 elements
        stooge(__lowercase      ,					__lowercase      ,					(h - t)     )


if __name__ == "__main__":
  __a   :							List[Any]						= input("Enter numbers separated by a comma:\n").strip()
  __a   :							List[str]						= [int(item) for item in user_input.split(",")]
  print(stooge_sort(unsorted))




