






'''simple docstring'''







def 			__UpperCamelCase				(			lowercase_					:     int = 998_001      ):
       """simple docstring"""




       for number in range(n - 1      ,					9_999      ,					-1      ):
              a_	    = str(lowercase_      )

              # checks whether 'str_number' is a palindrome.
              if str_number == str_number[::-1]:
                     a_	    = 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() = }""")












'''simple docstring'''







import re


def 			__UpperCamelCase				(			lowercase_					:     int      ):
       """simple docstring"""




       def docstring_decorator(lowercase_					:     int      ):
              a_	    = fn.__doc__
              a_	    = func_doc.split('\n'      )
              a_	    = 0
              while i < len(lowercase_      ) and re.search(R'^\s*Examples?:\s*$'      ,					lines[i]      ) is None:
                     i += 1
              if i < len(lowercase_      ):
                     a_	    = example_docstring
                     a_	    = '\n'.join(lowercase_      )
              else:
                     raise ValueError(
                         F'The function {fn} should have an empty \'Examples:\' in its docstring as placeholder, '
                         F'current docstring is:\n{func_doc}'      )
              a_	    = func_doc
              return fn

       return docstring_decorator




