



from itertools import combinations_with_replacement

def       A_   (						__a  :					Optional[Any] = 100		):

				"""simple docstring"""
				a__					   =		[*list(range(1			,		21		)		), 25]
				a__					   =		[2 * x for x in range(1			,		21		)] + [50]
				a__					   =		[3 * x for x in range(1			,		21		)]
				a__					   =		singles + doubles + triples + [0]

				a__					   =		0
				a__					   =		42
				a__					   =		42
				a__					   =		42
				a__					   =		42

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

				return num_checkouts


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


def 					UpperCamelCase__		(							A__ = 400_0000       )  ->   int:

				if n <= 1:
								return 0
				snake_case__   :      Optional[Any]   				= 0
				snake_case__   :      Optional[int]   				= 2
				snake_case__   :      str   				= 0
				while 4 * b + a <= n:
								snake_case__				,    snake_case__   :      Optional[Any]   				= b, 4 * b + a
								count += a
				return count + b


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


