



from itertools import combinations_with_replacement



def __lowerCAmelCase       (   SCREAMING_SNAKE_CASE_ = 100     ):
			lowercase__         = [*list(range(1  ,     21     )     ), 25]
			lowercase__         = [2 * x for x in range(1  ,     21     )] + [50]
			lowercase__         = [3 * x for x in range(1  ,     21     )]
			lowercase__         = singles + doubles + triples + [0]

			lowercase__         = 0
			lowercase__         = 42
			lowercase__         = 42
			lowercase__         = 42
			lowercase__         = 42

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

			return num_checkouts


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











def    _lowercase    (  _UpperCAmelCase = 99_80_01 )  ->     int:

				# fetches the next number
				for number in range(n - 1	,					99_99	,					-1 ):
								lowerCamelCase		       =str(_UpperCAmelCase )

								# checks whether 'str_number' is a palindrome.
								if str_number == str_number[::-1]:
												lowerCamelCase		       =9_99

												# if 'number' is a product of two 3-digit numbers
												# then number is the answer otherwise fetch next number.
												while divisor != 99:
																if (number % divisor == 0) and (len(str(number // divisor ) ) == 3.0):
																				return number
																divisor -= 1
				raise ValueError("""That number is larger than our acceptable range.""" )


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





