






'''simple docstring'''

from collections.abc import Generator







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







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


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








'''simple docstring'''

from maths.is_square_free import is_square_free
from maths.prime_factors import prime_factors







def    lowercase__			(				__UpperCamelCase   )->			int:
      UpperCamelCase      = prime_factors(__UpperCamelCase   )
      if is_square_free(__UpperCamelCase   ):
            return -1 if len(__UpperCamelCase   ) % 2 else 1
      return 0


if __name__ == "__main__":
     import doctest

     doctest.testmod()
