from itertools import combinations_with_replacement
def 					UpperCamelCase__		(							A__ = 100       )  ->   int:
				snake_case__   :      list[int]   				= [*list(range(1     ,					21       )       ), 25]
				snake_case__   :      list[int]   				= [2 * x for x in range(1     ,					21       )] + [50]
				snake_case__   :      list[int]   				= [3 * x for x in range(1     ,					21       )]
				snake_case__   :      list[int]   				= singles + doubles + triples + [0]

				snake_case__   :      int   				= 0
				snake_case__   :      int
				snake_case__   :      int
				snake_case__   :      int
				snake_case__   :      int

				for double in doubles:
								for throwa, throwa in combinations_with_replacement(A__     ,					2       ):
												snake_case__   :      Union[str, Any]   				= double + throwa + throwa
												if checkout_total < limit:
																num_checkouts += 1

				return num_checkouts


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



def 					UpperCamelCase__		(							A__     ,					A__       )  ->   Any:
				if len(str(A__       )       ) == 1 or len(str(A__       )       ) == 1:
								return a * b

				snake_case__   :      Union[str, Any]   				= max(len(str(A__       )       )     ,					len(str(A__       )       )       )
				snake_case__   :      str   				= ma // 2

				snake_case__				,    snake_case__   :      Tuple   				= divmod(A__     ,					10**ma       )
				snake_case__				,    snake_case__   :      str   				= divmod(A__     ,					10**ma       )

				snake_case__   :      Optional[int]   				= karatsuba(A__     ,					A__       )
				snake_case__   :      List[Any]   				= karatsuba((aa + aa)     ,					(ba + ba)       )
				snake_case__   :      Tuple   				= karatsuba(A__     ,					A__       )

				return (z * 10 ** (2 * ma)) + ((y - z - x) * 10 ** (ma)) + (x)
def 					UpperCamelCase__		(							)  ->   Optional[int]:
				print(karatsuba(1_5463     ,					2_3489       )       )


if __name__ == "__main__":
				main()


