






'''simple docstring'''



def    __UpperCAmelCase	(				SCREAMING_SNAKE_CASE__:	int    )  ->			int:

   """simple docstring"""
   if n == 1 or not isinstance(SCREAMING_SNAKE_CASE__,					SCREAMING_SNAKE_CASE__    ):
      return 0
   elif n == 2:
      return 1
   else:
      __a				     =    [0, 1]
      for i in range(2,					n + 1    ):
         sequence.append(sequence[i - 1] + sequence[i - 2]    )

      return sequence[n]



def    __UpperCAmelCase	(				SCREAMING_SNAKE_CASE__:	int    )  ->			int:

   """simple docstring"""
   __a				     =    0
   __a				     =    2

   while digits < n:
      index += 1
      __a				     =    len(str(fibonacci(SCREAMING_SNAKE_CASE__    )    )    )

   return index



def    __UpperCAmelCase	(				SCREAMING_SNAKE_CASE__:	int = 1000    )  ->			int:

   """simple docstring"""
   return fibonacci_digits_index(SCREAMING_SNAKE_CASE__    )


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







'''simple docstring'''



from maths.prime_factors import prime_factors



def    __UpperCAmelCase	(				SCREAMING_SNAKE_CASE__:	int    )  ->			int:

   """simple docstring"""
   if not isinstance(SCREAMING_SNAKE_CASE__,					SCREAMING_SNAKE_CASE__    ):
      __a				     =    f"""Input value of [number={number}] must be an integer"""
      raise TypeError(SCREAMING_SNAKE_CASE__    )
   if number < 1:
      raise ValueError('Input must be a positive integer'    )
   return -1 if len(prime_factors(SCREAMING_SNAKE_CASE__    )    ) % 2 else 1


if __name__ == "__main__":
 import doctest

 doctest.testmod()