






from doctest import testmod
from math import sqrt






def     lowerCamelCase__				(   __lowerCamelCase      :					List[str]		):
  __UpperCAmelCase							:     list[int]									=  []
  if num < 1:
    return facs
  facs.append(1		)
  if num == 1:
    return facs
  facs.append(__lowerCamelCase		)
  for i in range(2  ,		int(sqrt(__lowerCamelCase		)		) + 1		):
    if num % i == 0:  # If i is a factor of num
      facs.append(__lowerCamelCase		)
      __UpperCAmelCase							:     int									=  num // i  # num//i is the other factor of num
      if d != i:  # If d and i are distinct
        facs.append(__lowerCamelCase		)  # we have found another factor
  facs.sort()
  return facs


if __name__ == "__main__":
       testmod(name="factors_of_a_number", verbose=True)










def     lowerCamelCase__				(   ):

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

  for a in range(300		):
    for b in range(400		):
      __UpperCAmelCase							:     Optional[Any]									=  1000 - a - b
      if a < b < c and (a**2) + (b**2) == (c**2):
        return a * b * c

  return -1






def     lowerCamelCase__				(   ):
  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() = }""")


