






from math import factorial


def __A       ( __lowerCAmelCase					,						__lowerCAmelCase      )->    int:





						"""simple docstring"""



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


def __A       ( )->    List[Any]:





						"""simple docstring"""



						_UpperCAmelCase							   =     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'''

def  UpperCamelCase(	UpperCAmelCase_ = 1_00      ):
 UpperCAmelCase			:      Optional[Any]		   =					[[0 for _ in range(UpperCAmelCase_      )] for _ in range(m + 1      )]
 for i in range(m + 1      ):
  UpperCAmelCase			:      Optional[int]		   =					1

 for n in range(m + 1      ):
  for k in range(1    ,			UpperCAmelCase_      ):
   memo[n][k] += memo[n][k - 1]
   if n > k:
    memo[n][k] += memo[n - k - 1][k]

 return memo[m][m - 1] - 1


if __name__ == "__main__":
 print(solution(int(input("Enter a number: ").strip())))




