

def   UpperCamelCase(   lowercase_ = 998001				)      ->							int:





  '''simple docstring'''





  for number in range(n - 1     ,   9999     ,   -1				):
    snake_case_					= str(_lowercase				)

    # checks whether 'str_number' is a palindrome.
    if str_number == str_number[::-1]:
      snake_case_					= 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"""
def   A_    (     _lowercase,   _lowercase,   _lowercase,   _lowercase      ):







						'''simple docstring'''


						snake_case_					:Dict		=     int((lower_bound + upper_bound) // 2      )
						if array[r] == value:
												return r
						if lower_bound >= upper_bound:
												return -1
						if array[r] < value:
												return binary_search(_lowercase,   r + 1,   _lowercase,   _lowercase      )
						else:
												return binary_search(_lowercase,   _lowercase,   r - 1,   _lowercase      )
def   A_    (     _lowercase,   _lowercase      ):







						'''simple docstring'''


						snake_case_					:Any		=     0
						if matrix[index][0] == value:
												return [index, 0]
						while index < len(_lowercase      ) and matrix[index][0] < value:
												snake_case_					:List[str]		=     binary_search(matrix[index],   0,   len(matrix[index]      ) - 1,   _lowercase      )
												if r != -1:
																		return [index, r]
												index += 1
						return [-1, -1]


if __name__ == "__main__":
						import doctest

						doctest.testmod()
