




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














from __future__ import annotations

import re


def __A       ( __lowerCAmelCase      )->    list[str]:





						"""simple docstring"""



						def alphanum_key(__lowerCAmelCase      ):
												return [int(__lowerCAmelCase      ) if s.isdigit() else s.lower() for s in re.split('([0-9]+)'					,						__lowerCAmelCase      )]

						return sorted(__lowerCAmelCase					,						key=__lowerCAmelCase      )


if __name__ == "__main__":
		import doctest

		doctest.testmod()
