def SCREAMING_SNAKE_CASE					(  lowercase_:						int = 998001					):
       _UpperCamelCase  :							List[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					):
                     _UpperCamelCase  :							Any	    =	str(i * j					)
                     if product_string == product_string[::-1] and i * j < n:
                            _UpperCamelCase  :							Union[str, Any]	    =	max(lowercase_		,    i * j					)
       return answer


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






'''simple docstring'''


from __future__ import annotations







def     SCREAMING_SNAKE_CASE(	UpperCamelCase ,UpperCamelCase ,UpperCamelCase ,UpperCamelCase	)     ->     int:

	# 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(UpperCamelCase ,UpperCamelCase ,UpperCamelCase ,counter - 1	)
	else:
		UpperCAmelCase_		:   int													=       capacity - weights[counter - 1]
		UpperCAmelCase_		:   Optional[int]													=       values[counter - 1] + knapsack(
		    UpperCamelCase ,UpperCamelCase ,UpperCamelCase ,counter - 1	)
		UpperCAmelCase_		:   Any													=       knapsack(UpperCamelCase ,UpperCamelCase ,UpperCamelCase ,counter - 1	)
		return max(UpperCamelCase ,UpperCamelCase	)


if __name__ == "__main__":
						import doctest

						doctest.testmod()






