"""simple docstring"""







from math import factorial
def     __UpperCAmelCase							(       UpperCAmelCase_       :							Tuple     ,				UpperCAmelCase_       :							int    )				->     Union[str, Any]:

	'''simple docstring'''





	return factorial(UpperCAmelCase_    ) / (factorial(UpperCAmelCase_    ) * factorial(n - r    ))
def     __UpperCAmelCase							(       )				->     Optional[Any]:

	'''simple docstring'''





	__snake_case     :				Optional[int] 						=					0

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


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






"""simple docstring"""







_a	:	Optional[Any]=					{
    "+": lambda x, y: x + y,
    "-": lambda x, y: x - y,
    "*": lambda x, y: x * y,
    "/": lambda x, y: x / y,
}
def     __UpperCAmelCase							(       UpperCAmelCase_       :							List[Any]    )				->     List[Any]:

	'''simple docstring'''





	return c.isdigit()
def     __UpperCAmelCase							(       UpperCAmelCase_       :							int    )				->     List[Any]:

	'''simple docstring'''





	__snake_case     :				Dict 						=					[]

	# iterate over the string in reverse order
	for c in expression.split()[::-1]:
		# push operand to stack
		if is_operand(UpperCAmelCase_    ):
			stack.append(int(UpperCAmelCase_    )    )

		else:
			# pop values from stack can calculate the result
			# push the result onto the stack again
			__snake_case     :				Optional[Any] 						=					stack.pop()
			__snake_case     :				int 						=					stack.pop()
			stack.append(calc[c](UpperCAmelCase_     ,				UpperCAmelCase_    )    )

	return stack.pop()


# Driver code
if __name__ == "__main__":
	_a	:	Union[str, Any]=					"+ 9 * 2 6"
	print(evaluate(test_expression))

	_a	:	List[Any]=					"/ * 10 2 + 4 1 "
	print(evaluate(test_expression))





