
from typing import Any







class     __A:




				def __init__(  self       )					->   Optional[int]:


								'''simple docstring'''




								__a    							=					[]
								__a    							=					0




				def __str__(  self       )					->   List[str]:


								'''simple docstring'''




								__a    							=					'''<''' + str(self.stack       )[1:-1] + '''>'''
								return printed




				def        SCREAMING_SNAKE_CASE_	(  self	,  _snake_case       )					->   Optional[int]:


								'''simple docstring'''




								self.stack.append(_snake_case       )
								__a    							=					self.length + 1




				def        SCREAMING_SNAKE_CASE_	(  self       )					->   int:


								'''simple docstring'''




								self.rotate(1       )
								__a    							=					self.stack[self.length - 1]
								__a    							=					self.stack[:-1]
								self.rotate(self.length - 1       )
								__a    							=					self.length - 1
								return dequeued




				def        SCREAMING_SNAKE_CASE_	(  self	,  _snake_case       )					->   Optional[int]:


								'''simple docstring'''




								for _ in range(_snake_case       ):
												__a    							=					self.stack[0]
												__a    							=					self.stack[1:]
												self.put(_snake_case       )
												__a    							=					self.length - 1




				def        SCREAMING_SNAKE_CASE_	(  self       )					->   Dict:


								'''simple docstring'''




								__a    							=					self.get()
								self.put(_snake_case       )
								self.rotate(self.length - 1       )
								return front




				def        SCREAMING_SNAKE_CASE_	(  self       )					->   int:


								'''simple docstring'''




								return self.length

def 					__lowerCAmelCase    (    a__ = 99_8001						) ->						int:
				__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(a__		,					i * j						)
				return answer


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