

from collections import defaultdict
def   _lowerCAmelCase(						__A = 5      ):
  UpperCAmelCase          =	defaultdict(__A      )
  UpperCAmelCase          =	0

  while True:
    UpperCAmelCase          =	get_digits(__A      )
    freqs[digits].append(__A      )

    if len(freqs[digits]      ) == max_base:
      UpperCAmelCase          =	freqs[digits][0] ** 3
      return base

    num += 1
def   _lowerCAmelCase(						__A      ):
  return "".join(sorted(str(num**3      )      )      )


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






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



