





def   _lowercase       (    _UpperCAmelCase = 99_80_01					)    ->	int:

				# fetches the next number
				for number in range(n - 1      ,   99_99      ,   -1					):
								lowerCamelCase									=str(_UpperCAmelCase					)

								# checks whether 'str_number' is a palindrome.
								if str_number == str_number[::-1]:
												lowerCamelCase									=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'''





class 			UpperCamelCase__	:






 def __init__(      self	:Tuple						,					_A	:int      )					->      None:







       '''simple docstring'''



       __A													=      data
       __A													=      None
       __A													=      None





def 							snake_case				(		UpperCAmelCase   ,	UpperCAmelCase						)->      BinaryTreeNode | None:







      """simple docstring"""
      if node is None:
            __A													=      BinaryTreeNode(UpperCAmelCase						)
            return node

      # binary search tree is not empty,
      # so we will insert it into the tree
      # if new_value is less than value of data in node,
      #  add it to left subtree and proceed recursively
      if new_value < node.data:
            __A													=      insert(node.left_child   ,	UpperCAmelCase						)
      else:
            # if new_value is greater than value of data in node,
            #  add it to right subtree and proceed recursively
            __A													=      insert(node.right_child   ,	UpperCAmelCase						)
      return node





def 							snake_case				(		UpperCAmelCase						)->      list[int]:  # if node is None,return







      """simple docstring"""
      if node:
            __A													=      inorder(node.left_child						)
            __A													=      [*inorder_array, node.data]
            __A													=      inorder_array + inorder(node.right_child						)
      else:
            __A													=      []
      return inorder_array





def 							snake_case				(		)->      BinaryTreeNode | None:







      """simple docstring"""
      __A													=      insert(UpperCAmelCase   ,	1_5						)
      insert(UpperCAmelCase   ,	1_0						)
      insert(UpperCAmelCase   ,	2_5						)
      insert(UpperCAmelCase   ,	6						)
      insert(UpperCAmelCase   ,	1_4						)
      insert(UpperCAmelCase   ,	2_0						)
      insert(UpperCAmelCase   ,	6_0						)
      return root





def 							snake_case				(		)->      None:







      """simple docstring"""
      # main function
      __A													=      make_tree()
      print('Printing values of binary search tree in Inorder Traversal.'						)
      inorder(UpperCAmelCase						)


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 main()






