


from collections.abc import Generator



def        UpperCamelCase_(   )					->		Generator[int, None, None]:
    _lowercase	,       _lowercase :							Any   	=	0, 1
    while True:
        _lowercase	,       _lowercase :							int   	=	b, a + b
        yield b



def        UpperCamelCase_(   lowerCamelCase_ = 1000				)					->		int:
    _lowercase :							Dict   	=	1
    _lowercase :							Dict   	=	fibonacci_generator()
    while len(str(next(lowerCamelCase_				)				)				) < n:
        answer += 1
    return answer + 1


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






def        UpperCamelCase_(   lowerCamelCase_				)					->		int:
    assert (
        isinstance(lowerCamelCase_							,				lowerCamelCase_				) and number_of_steps > 0
    ), F'''number_of_steps needs to be positive integer, your input {number_of_steps}'''
    if number_of_steps == 1:
        return 1
    _lowercase	,       _lowercase :							Dict   	=	1, 1
    for _ in range(number_of_steps - 1				):
        _lowercase	,       _lowercase :							Tuple   	=	current + previous, current
    return current


if __name__ == "__main__":
 import doctest

 doctest.testmod()


