from collections.abc import Generator





def  _lowerCamelCase					(   ):
			lowerCamelCase  ,    lowerCamelCase						:Any						  =     0, 1
			while True:
						lowerCamelCase  ,    lowerCamelCase						:Dict						  =     b, a + b
						yield b





def  _lowerCamelCase					(   a_				: Dict = 10_00):
			lowerCamelCase						:Optional[int]						  =     1
			lowerCamelCase						:Dict						  =     fibonacci_generator()
			while len(str(next(a_))) < n:
						answer += 1
			return answer + 1


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




import os
from math import logaa





def  _lowerCamelCase					(   a_				: str = "base_exp.txt"):
			lowerCamelCase						:float						  =     0
			lowerCamelCase						:Optional[int]						  =     0
			for i, line in enumerate(open(os.path.join(os.path.dirname(a_)						,			a_))):
						lowerCamelCase  ,    lowerCamelCase						:Optional[int]						  =     list(map(a_						,			line.split(''',''')))
						if x * logaa(a_) > largest:
									lowerCamelCase						:List[Any]						  =     x * logaa(a_)
									lowerCamelCase						:Any						  =     i + 1
			return result


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



