



"""simple docstring"""






from collections.abc import Generator




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




def 			snake_case		(		lowerCAmelCase_ = 1000	)						->				int:
  _snake_case   	=      1
  _snake_case   	=      fibonacci_generator()
  while len(str(next(lowerCAmelCase_	)	)	) < n:
    answer += 1
  return answer + 1


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












"""simple docstring"""





from __future__ import annotations



def 					lowerCAmelCase_      (   SCREAMING_SNAKE_CASE							:				list[int | str] ):


							'''simple docstring'''







							create_state_space_tree(SCREAMING_SNAKE_CASE     ,    []     ,    0     ,    [0 for i in range(len(SCREAMING_SNAKE_CASE ) )] )



def 					lowerCAmelCase_      (   SCREAMING_SNAKE_CASE							:				list[int | str]     ,    SCREAMING_SNAKE_CASE							:				list[int | str]     ,    SCREAMING_SNAKE_CASE							:				int     ,    SCREAMING_SNAKE_CASE							:				list[int]     ,    ):


							'''simple docstring'''







							if index == len(SCREAMING_SNAKE_CASE ):
														print(SCREAMING_SNAKE_CASE )
														return

							for i in range(len(SCREAMING_SNAKE_CASE ) ):
														if not index_used[i]:
																					current_sequence.append(sequence[i] )
																					__lowerCamelCase   :   List[Any]       =True
																					create_state_space_tree(SCREAMING_SNAKE_CASE     ,    SCREAMING_SNAKE_CASE     ,    index + 1     ,    SCREAMING_SNAKE_CASE )
																					current_sequence.pop()
																					__lowerCamelCase   :   List[Any]       =False
_UpperCamelCase					      =   [3, 1, 2, 4]
generate_all_permutations(sequence)

_UpperCamelCase					      =   ["A", "B", "C"]
generate_all_permutations(sequence_a)




