


from __future__ import annotations





class    _a				:




	def __init__(   self		:						int						,   _SCREAMING_SNAKE_CASE		:						int						)->			None:
			lowerCAmelCase__  :     Optional[Any]       	=   value
			lowerCAmelCase__  :     Node | None       	=   None
			lowerCAmelCase__  :     Node | None       	=   None





class    _a				:
	_a    :    int




	def __init__(   self		:						str						)->			None:
			lowerCAmelCase__  :     Optional[int]       	=   0




	def 				UpperCAmelCase__(   self		:						Optional[Any]						,   _SCREAMING_SNAKE_CASE		:						Node | None						,   _SCREAMING_SNAKE_CASE		:						int						)->			None:
			if node is None:
					return

			if path_sum == self.target:
					self.paths += 1

			if node.left:
					self.depth_first_search(node.left						,   path_sum + node.left.value						)
			if node.right:
					self.depth_first_search(node.right						,   path_sum + node.right.value						)




	def 				UpperCAmelCase__(   self		:						List[str]						,   _SCREAMING_SNAKE_CASE		:						Node | None						,   _SCREAMING_SNAKE_CASE		:						int | None = None						)->			int:
			if node is None:
					return 0
			if target is not None:
					lowerCAmelCase__  :     str       	=   target

			self.depth_first_search(_SCREAMING_SNAKE_CASE						,   node.value						)
			self.path_sum(node.left						)
			self.path_sum(node.right						)

			return self.paths


if __name__ == "__main__":
		import doctest

		doctest.testmod()








from itertools import combinations_with_replacement






def 	lowerCamelCase_       (			_a = 100			):




		"""simple docstring"""






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

		lowerCAmelCase__  :     int       	=   0
		lowerCAmelCase__  :     int
		lowerCAmelCase__  :     int
		lowerCAmelCase__  :     int
		lowerCAmelCase__  :     int

		for double in doubles:
				for throwa, throwa in combinations_with_replacement(_a      ,  2			):
						lowerCAmelCase__  :     Dict       	=   double + throwa + throwa
						if checkout_total < limit:
								num_checkouts += 1

		return num_checkouts


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




