"""simple docstring"""
def 		__a  (      _SCREAMING_SNAKE_CASE = 998001  )      ->int:

  # fetches the next number
  for number in range(n - 1						,	9999						,	-1  ):
    a__:	Dict     				=      str(_SCREAMING_SNAKE_CASE  )

    # checks whether 'str_number' is a palindrome.
    if str_number == str_number[::-1]:
      a__:	Optional[int]     				=      999

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










def        _lowerCamelCase(      lowerCAmelCase__					:		float     ,     lowerCAmelCase__					:		float     ,     lowerCAmelCase__					:		float   ):





				'''simple docstring'''







				if mass < 0:
								raise ValueError('The mass of the body cannot be negative'   )
				if radius <= 0:
								raise ValueError('The radius is always a positive non zero integer'   )
				return (mass * (velocity) ** 2) / radius


if __name__ == "__main__":
				import doctest

				doctest.testmod(verbose=True)