





'''simple docstring'''







from math import factorial





def 							lowerCamelCase_   (	SCREAMING_SNAKE_CASE__   :      Any,      SCREAMING_SNAKE_CASE__   :      Union[str, Any] )			->						Optional[int]:
						return factorial(SCREAMING_SNAKE_CASE__ ) / (factorial(SCREAMING_SNAKE_CASE__ ) * factorial(n - r ))





def 							lowerCamelCase_   (	)			->						int:
						UpperCAmelCase_      :   str      =	0

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


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












'''simple docstring'''


from typing import Callable




def       A							(      _UpperCAmelCase   :				Callable					)  ->				Dict:


  '''simple docstring'''




  def wrapper(_UpperCAmelCase   :				Optional[Any]					):
    __lowerCAmelCase		:    List[Any]			     =  function_with_docstring.__doc__
    return target_function

  return wrapper





