


"""simple docstring"""





from __future__ import annotations



class 		snake_case_:






     def __init__(						self	:       int       ,					UpperCamelCase_	:       int					):
           lowerCAmelCase       :						Optional[Any]							= value
           lowerCAmelCase       :						Node | None							= None
           lowerCAmelCase       :						Node | None							= None



class 		snake_case_:
     __UpperCamelCase	=       42






     def __init__(						self	:       str					):
           lowerCAmelCase       :						Optional[int]							= 0






     def   lowerCamelCase__  (						self	:       Optional[Any]       ,					UpperCamelCase_	:       Node | None       ,					UpperCamelCase_	:       int					):
           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   lowerCamelCase__  (						self	:       List[str]       ,					UpperCamelCase_	:       Node | None       ,					UpperCamelCase_	:       int | None = None					):
           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() = }''')




