





'''simple docstring'''


from math import factorial




def    __a (     UpperCAmelCase       ,			UpperCAmelCase    )      ->Optional[Any]:



	"""simple docstring"""







	return factorial(UpperCAmelCase    ) / (factorial(UpperCAmelCase    ) * factorial(n - r    ))




def    __a (     )      ->Union[str, Any]:



	"""simple docstring"""







	A							  =      0

	for i in range(1       ,			101    ):
		for j in range(1       ,			i + 1    ):
			if combinations(UpperCAmelCase       ,			UpperCAmelCase    ) > 1E6:
				total += 1
	return total


if __name__ == "__main__":
				print(solution())








'''simple docstring'''


from __future__ import annotations



class 							__UpperCAmelCase  :







		'''simple docstring'''







		def __init__(self						:      Any      ,      _lowerCAmelCase						:      int      ):
			A							  =      value
			A							  =      None
			A							  =      None






class 							__UpperCAmelCase  :







		'''simple docstring'''







		__lowerCAmelCase 				=    42







		def __init__(self						:      List[str]      ):
			A							  =      0







		def        A     (self						:      Dict      ,      _lowerCAmelCase						:      Node | None      ,      _lowerCAmelCase						:      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        A     (self						:      Optional[Any]      ,      _lowerCAmelCase						:      Node | None      ,      _lowerCAmelCase						:      int | None = None      ):
			if node is None:
				return 0
			if target is not None:
				A							  =      target

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

			return self.paths


if __name__ == "__main__":
				import doctest

				doctest.testmod()

