

'''simple docstring'''



def    a__       (  a__						):




     """simple docstring"""


     if n == 1 or not isinstance(a__      ,    a__						):
          return 0
     elif n == 2:
          return 1
     else:
          __SCREAMING_SNAKE_CASE     =      [0, 1]
          for i in range(2      ,    n + 1						):
               sequence.append(sequence[i - 1] + sequence[i - 2]						)

          return sequence[n]







def    a__       (  a__						):




     """simple docstring"""


     __SCREAMING_SNAKE_CASE     =      0
     __SCREAMING_SNAKE_CASE     =      2

     while digits < n:
          index += 1
          __SCREAMING_SNAKE_CASE     =      len(str(fibonacci(a__						)						)						)

     return index







def    a__       (  a__ = 10_00						):




     """simple docstring"""


     return fibonacci_digits_index(a__						)


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







"""simple docstring"""






def   a_						(					lowerCamelCase					,			lowerCamelCase       ):
				if a < 0 or b < 0:
								raise ValueError('the value of both inputs must be positive'       )

				UpperCAmelCase__             =							str(bin(lowerCamelCase       )       )[2:]  # remove the leading "0b"
				UpperCAmelCase__             =							str(bin(lowerCamelCase       )       )[2:]  # remove the leading "0b"

				UpperCAmelCase__             =							max(len(lowerCamelCase       )					,			len(lowerCamelCase       )       )

				return "0b" + "".join(
				    str(int(char_a == '1' and char_b == '1'       )       )
				    for char_a, char_b in zip(a_binary.zfill(lowerCamelCase       )					,			b_binary.zfill(lowerCamelCase       )       )       )


if __name__ == "__main__":
						import doctest

						doctest.testmod()



