


"""simple docstring"""






def       A_   (   _lowerCAmelCase     :					int       ):






     """simple docstring"""

     if n == 1 or not isinstance(snake_case_,     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       A_   (   _lowerCAmelCase     :					int       ):






     """simple docstring"""

     _a    	=				0
     _a    	=				2

     while digits < n:
          index += 1
          _a    	=				len(str(fibonacci(snake_case_       )       )       )

     return index
def       A_   (   _lowerCAmelCase     :					int = 10_00       ):






     """simple docstring"""

     return fibonacci_digits_index(snake_case_       )


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



"""simple docstring"""






def       A_   (   _lowerCAmelCase     :					list,     _lowerCAmelCase     :					list,     _lowerCAmelCase     :					int       ):






     """simple docstring"""

     _a    	=				len(_lowerCAmelCase       )
     _a    	=				[[0] * n for i in range(_lowerCAmelCase       )]
     for i in range(_lowerCAmelCase       ):
          _a    	=				y_points[i]

     for i in range(2,     _lowerCAmelCase       ):
          for j in range(_lowerCAmelCase,     _lowerCAmelCase       ):
               _a    	=				(
                   (xa - x_points[j - i + 1]) * q[j][i - 1]
                   - (xa - x_points[j]) * q[j - 1][i - 1]
               ) / (x_points[j] - x_points[j - i + 1])

     return [q[n - 1][n - 1], q]


if __name__ == "__main__":
   import doctest

   doctest.testmod()