




def        __SCREAMING_SNAKE_CASE (	lowercase_ = 99_80_01   )							->						int:

    """simple docstring"""


    for number in range(n - 1       ,  99_99       ,  -1   ):
        __UpperCamelCase			=    str(lowercase_   )

        # checks whether 'str_number' is a palindrome.
        if str_number == str_number[::-1]:
            __UpperCamelCase			=    9_99

            # if 'number' is a product of two 3-digit numbers
            # then number is the answer otherwise fetch next number.
            while divisor != 99:
                if (number % divisor == 0) and (len(str(number // divisor   )   ) == 3.0):
                    return number
                divisor -= 1
    raise ValueError('''That number is larger than our acceptable range.'''   )


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








'''simple docstring'''







from collections import defaultdict







def   lowerCAmelCase(  a__    :  int = 5      ):







       '''simple docstring'''






       lowerCamelCase__				   =      defaultdict(a__      )
       lowerCamelCase__				   =      0

       while True:
              lowerCamelCase__				   =      get_digits(a__      )
              freqs[digits].append(a__      )

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

              num += 1







def   lowerCAmelCase(  a__    :  int      ):







       '''simple docstring'''






       return "".join(sorted(str(num**3      )      )      )


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

