"""simple docstring"""







from itertools import combinations_with_replacement



def       A__    (	lowercase_     :	int = 100						)  ->							int:
   __lowerCamelCase    		=					[*list(range(1      , 21						)						), 25]
   __lowerCamelCase    		=					[2 * x for x in range(1      , 21						)] + [50]
   __lowerCamelCase    		=					[3 * x for x in range(1      , 21						)]
   __lowerCamelCase    		=					singles + doubles + triples + [0]

   __lowerCamelCase    		=					0
   __lowerCamelCase    		=					42
   __lowerCamelCase    		=					42
   __lowerCamelCase    		=					42
   __lowerCamelCase    		=					42

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

   return num_checkouts


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











from math import gcd

def       A_   (						__a  :					int = 12_000		):

				"""simple docstring"""
				a__					   =		0
				for d in range(max_d + 1		):
								for n in range(d // 3 + 1			,		(d + 1) // 2		):
												if gcd(__a			,		__a		) == 1:
																fractions_number += 1
				return fractions_number


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

