



def 	UpperCAmelCase__      (      UpperCAmelCase__ :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 	UpperCAmelCase__      (      UpperCAmelCase__ :int					):






 '''simple docstring'''

 a						=		0
 a						=		2

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

 return index


def 	UpperCAmelCase__      (      UpperCAmelCase__ :int = 10_00					):






 '''simple docstring'''

 return fibonacci_digits_index(snake_case_					)


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






def 	UpperCAmelCase__      (      UpperCAmelCase__ :int ,					UpperCAmelCase__ :int					):






 '''simple docstring'''

 if a < 0 or b < 0:
  raise ValueError("the value of both inputs must be positive"					)

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

 a						=		max(len(UpperCAmelCase__					) ,					len(UpperCAmelCase__					)					)

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


if __name__ == "__main__":
     import doctest

     doctest.testmod()

