



'''simple docstring'''







def  SCREAMING_SNAKE_CASE__ (				SCREAMING_SNAKE_CASE = 99_8001     ):
		SCREAMING_SNAKE_CASE_						:Any										=      0
		for i in range(999 ,		99 ,		-1     ):  # 3 digit numbers range from 999 down to 100
				for j in range(999 ,		99 ,		-1     ):
						SCREAMING_SNAKE_CASE_						:Tuple										=      str(i * j     )
						if product_string == product_string[::-1] and i * j < n:
								SCREAMING_SNAKE_CASE_						:List[Any]										=      max(SCREAMING_SNAKE_CASE ,		i * j     )
		return answer


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








"""simple docstring"""







from __future__ import annotations





def 							SCREAMING_SNAKE_CASE							(   lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_):

					# Base Case
					if counter == 0 or capacity == 0:
										return 0

					# If weight of the nth item is more than Knapsack of capacity,
					#   then this item cannot be included in the optimal solution,
					# else return the maximum of two cases:
					#   (1) nth item included
					#   (2) not included
					if weights[counter - 1] > capacity:
										return knapsack(lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_			,  counter - 1)
					else:
										a__ 							=	capacity - weights[counter - 1]
										a__ 							=	values[counter - 1] + knapsack(
										    lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_			,  counter - 1)
										a__ 							=	knapsack(lowerCamelCase_			,  lowerCamelCase_			,  lowerCamelCase_			,  counter - 1)
										return max(lowerCamelCase_			,  lowerCamelCase_)


if __name__ == "__main__":
	import doctest

	doctest.testmod()


