



"""simple docstring"""







def  __SCREAMING_SNAKE_CASE (  __UpperCAmelCase = 4000000      ):

		if n <= 1:
				return 0
		_lowercase				: Tuple     =   0
		_lowercase				: int     =   2
		_lowercase				: List[Any]     =   0
		while 4 * b + a <= n:
				_lowercase     ,  _lowercase				: Union[str, Any]     =   b, 4 * b + a
				count += a
		return count + b


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








"""simple docstring"""







from math import factorial


def  __SCREAMING_SNAKE_CASE (  __UpperCAmelCase   ,				__UpperCAmelCase      ):
		return factorial(__UpperCAmelCase      ) / (factorial(__UpperCAmelCase      ) * factorial(n - r      ))


def  __SCREAMING_SNAKE_CASE (  ):
		_lowercase				: Optional[Any]     =   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())



