


from collections.abc import Generator


def 				lowerCamelCase__	(      )    ->	Generator[int, None, None]:





			"""simple docstring"""
			a__  ,  a__ :str						  =    0, 1
			while True:
						a__  ,  a__ :Optional[int]						  =    b, a + b
						yield b


def 				lowerCamelCase__	(      a	:   Any = 1_000				)    ->	int:





			"""simple docstring"""
			a__ :Optional[int]						  =    1
			a__ :Tuple						  =    fibonacci_generator()
			while len(str(next(a				)				)				) < n:
						answer += 1
			return answer + 1


if __name__ == "__main__":
		print(solution(int(str(input()).strip())))






def 				lowerCamelCase__	(      a	:   int = 100				)    ->	int:





			"""simple docstring"""
			a__ :Tuple						  =    n * (n + 1) * (2 * n + 1) / 6
			a__ :Tuple						  =    (n * (n + 1) / 2) ** 2
			return int(square_of_sum - sum_of_squares				)


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


