from math import factorial
def 					UpperCamelCase__		(							A__     ,					A__       )  ->   List[Any]:
				return factorial(A__       ) / (factorial(A__       ) * factorial(n - r       ))
def 					UpperCamelCase__		(							)  ->   Optional[int]:
				snake_case__   :      Tuple   				= 0

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


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



def 					UpperCamelCase__		(							A__ = 400_0000       )  ->   int:

				if n <= 1:
								return 0
				snake_case__   :      Optional[Any]   				= 0
				snake_case__   :      Optional[int]   				= 2
				snake_case__   :      str   				= 0
				while 4 * b + a <= n:
								snake_case__				,    snake_case__   :      Optional[Any]   				= b, 4 * b + a
								count += a
				return count + b


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


