






def   lowercase__   (  __snake_case					:							int  , __snake_case					:							int						):


					'''simple docstring'''


					UpperCAmelCase_					:   Optional[int]   =		1.0
					for i in range(1  , r + 1						):
										ret *= (n + 1 - i) / i
					return round(__snake_case						)




def   lowercase__   (  __snake_case					:							int						):


					'''simple docstring'''


					return choose(8 + n  , __snake_case						) + choose(9 + n  , __snake_case						) - 10




def   lowercase__   (  __snake_case					:							int						):


					'''simple docstring'''


					return sum(non_bouncy_exact(__snake_case						) for i in range(1  , n + 1						)						)




def   lowercase__   (  __snake_case					:							int = 100						):


					'''simple docstring'''


					return non_bouncy_upto(__snake_case						)


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














from __future__ import annotations



class 						lowerCamelCase   :







		'''simple docstring'''



		def __init__(							self       ,	_UpperCamelCase = 0     )			->							None:
							UpperCAmelCase_					:   int   =		value
							UpperCAmelCase_					:   Node | None   =		None
							UpperCAmelCase_					:   Node | None   =		None





def   lowercase__   (  __snake_case					:							Node | None  , __snake_case					:							Node | None						):


					'''simple docstring'''


					if treea is None:
										return treea
					if treea is None:
										return treea

					UpperCAmelCase_					:   List[Any]   =		treea.value + treea.value
					UpperCAmelCase_					:   Dict   =		merge_two_binary_trees(treea.left  , treea.left						)
					UpperCAmelCase_					:   str   =		merge_two_binary_trees(treea.right  , treea.right						)
					return treea




def   lowercase__   (  __snake_case					:							Node | None						):


					'''simple docstring'''


					if root:
										print(root.value						)
										print_preorder(root.left						)
										print_preorder(root.right						)


if __name__ == "__main__":
		__UpperCAmelCase										=		Node(1)
		__UpperCAmelCase										=		Node(2)
		__UpperCAmelCase										=		Node(3)
		__UpperCAmelCase										=		Node(4)

		__UpperCAmelCase										=		Node(2)
		__UpperCAmelCase										=		Node(4)
		__UpperCAmelCase										=		Node(6)
		__UpperCAmelCase										=		Node(9)
		__UpperCAmelCase										=		Node(5)

		print('Tree1 is: ')
		print_preorder(treea)
		print('Tree2 is: ')
		print_preorder(treea)
		__UpperCAmelCase										=		merge_two_binary_trees(treea, treea)
		print('Merged Tree is: ')
		print_preorder(merged_tree)






