






'''simple docstring'''





def 			__UpperCAmelCase				(lowercase__ = 998001				)		->				int:

						'''simple docstring'''


						a_				     =   0
						for i in range(999	,99	,-1				):  # 3 digit numbers range from 999 down to 100
												for j in range(999	,99	,-1				):
																		a_				     =   str(i * j				)
																		if product_string == product_string[::-1] and i * j < n:
																								a_				     =   max(lowercase__	,i * j				)
						return answer


if __name__ == "__main__":
							print(F'{solution() = }')











'''simple docstring'''





from __future__ import annotations





class 		SCREAMING_SNAKE_CASE__   :



		def __init__(    self:    List[str]				,   a:    int = 0)  ->None:






								'''simple docstring'''


								a_				     =   value
								a_				     =   None
								a_				     =   None





def 			__UpperCAmelCase				(lowercase__	,lowercase__				)		->				Node | None:

						'''simple docstring'''


						if treea is None:
												return treea
						if treea is None:
												return treea

						a_				     =   treea.value + treea.value
						a_				     =   merge_two_binary_trees(treea.left	,treea.left				)
						a_				     =   merge_two_binary_trees(treea.right	,treea.right				)
						return treea



def 			__UpperCAmelCase				(lowercase__				)		->				None:

						'''simple docstring'''


						if root:
												print(root.value				)
												print_preorder(root.left				)
												print_preorder(root.right				)


if __name__ == "__main__":
							a_      = Node(1)
							a_      = Node(2)
							a_      = Node(3)
							a_      = Node(4)

							a_      = Node(2)
							a_      = Node(4)
							a_      = Node(6)
							a_      = Node(9)
							a_      = Node(5)

							print('Tree1 is: ')
							print_preorder(treea)
							print('Tree2 is: ')
							print_preorder(treea)
							a_      = merge_two_binary_trees(treea, treea)
							print('Merged Tree is: ')
							print_preorder(merged_tree)



