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


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





def 							lowerCAmelCase(	__lowerCamelCase = 10**6						):

					if n <= 0:
										raise ValueError('Please enter an integer greater than 0'						)

					__a							=   list(range(n + 1						)						)
					for number in range(2      ,				n + 1						):
										if phi[number] == number:
															phi[number] -= 1
															for multiple in range(number * 2      ,				n + 1      ,				__lowerCamelCase						):
																				__a							=   (phi[multiple] // number) * (number - 1)

					__a							=   1
					for number in range(1      ,				n + 1						):
										if (answer / phi[answer]) < (number / phi[number]):
															__a							=   number

					return answer


if __name__ == "__main__":
	print(solution())




