
class 						__magic_name__				:





		def __init__(							self      :		Any			):
							lowerCAmelCase						:   List[Any]							=       []
							lowerCAmelCase						:   Tuple							=       0
							lowerCAmelCase						:   int							=       0





		def __str__(							self      :		Dict			):
							lowerCAmelCase						:   Dict							=       '''<''' + str(self.entries			)[1:-1] + '''>'''
							return printed





		def  _A							(							self      :		Dict  ,					lowerCamelCase__      :		Optional[Any]			):
							self.entries.append(lowerCamelCase__			)
							lowerCAmelCase						:   Union[str, Any]							=       self.length + 1





		def  _A							(							self      :		Dict			):
							lowerCAmelCase						:   List[str]							=       self.length - 1
							lowerCAmelCase						:   str							=       self.entries[self.front]
							# self.front-=1
							# self.entries = self.entries[self.front:]
							lowerCAmelCase						:   Optional[Any]							=       self.entries[1:]
							return dequeued





		def  _A							(							self      :		List[Any]  ,					lowerCamelCase__      :		Dict			):
							for _ in range(lowerCamelCase__			):
												self.put(self.get()			)





		def  _A							(							self      :		Any			):
							return self.entries[0]





		def  _A							(							self      :		Union[str, Any]			):
							return self.length


def       UpperCAmelCase__							(    __magic_name__  :       int = 99_80_01					):


					'''simple docstring'''

					lowerCAmelCase						:   Tuple							=       0
					for i in range(9_99							,					99							,					-1					):  # 3 digit numbers range from 999 down to 100
										for j in range(9_99							,					99							,					-1					):
															lowerCAmelCase						:   Any							=       str(i * j					)
															if product_string == product_string[::-1] and i * j < n:
																				lowerCAmelCase						:   Optional[int]							=       max(__magic_name__							,					i * j					)
					return answer


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