




"""simple docstring"""

def       snake_case__	(       lowerCAmelCase   :		int = 998_001		):
					__snake_case          =	0
					for i in range(999				,					99				,					-1		):  # 3 digit numbers range from 999 down to 100
										for j in range(999				,					99				,					-1		):
															__snake_case          =	str(i * j		)
															if product_string == product_string[::-1] and i * j < n:
																				__snake_case          =	max(lowerCAmelCase				,					i * j		)
					return answer


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








"""simple docstring"""

from itertools import combinations_with_replacement




def       snake_case__	(       lowerCAmelCase   :		int = 100		):
					__snake_case          =	[*list(range(1				,					21		)		), 25]
					__snake_case          =	[2 * x for x in range(1				,					21		)] + [50]
					__snake_case          =	[3 * x for x in range(1				,					21		)]
					__snake_case          =	singles + doubles + triples + [0]

					__snake_case          =	0
					__snake_case          =	42
					__snake_case          =	42
					__snake_case          =	42
					__snake_case          =	42

					for double in doubles:
										for throwa, throwa in combinations_with_replacement(lowerCAmelCase				,					2		):
															__snake_case          =	double + throwa + throwa
															if checkout_total < limit:
																				num_checkouts += 1

					return num_checkouts


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


