





'''simple docstring'''





from collections.abc import Generator





def    __UpperCamelCase      (    ) ->Any:
					lowerCamelCase__    ,		lowerCamelCase__       =       0, 1
					while True:
										lowerCamelCase__    ,		lowerCamelCase__       =       b, a + b
										yield b





def    __UpperCamelCase      (    a = 1000) ->Tuple:
					lowerCamelCase__       =       1
					lowerCamelCase__       =       fibonacci_generator()
					while len(str(next(lowercase__))) < n:
										answer += 1
					return answer + 1


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








def    __UpperCamelCase      (    a = 100) ->int:
					lowerCamelCase__       =       (n * (n + 1) // 2) ** 2
					lowerCamelCase__       =       n * (n + 1) * (2 * n + 1) // 6
					return sum_cubes - sum_squares


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

