




def  SCREAMING_SNAKE_CASE							(       __UpperCamelCase)      ->					int:
     if n == 1 or not isinstance(__UpperCamelCase		, __UpperCamelCase):
          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  SCREAMING_SNAKE_CASE							(       __UpperCamelCase)      ->					int:
     a     =				0
     a     =				2

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

     return index

def  SCREAMING_SNAKE_CASE							(       __UpperCamelCase = 10_00)      ->					int:
     return fibonacci_digits_index(__UpperCamelCase)


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







import math

def  SCREAMING_SNAKE_CASE							(       __UpperCamelCase)      ->					bool:

     if 1 < number < 4:
          # 2 and 3 are primes
          return True
     elif number < 2 or number % 2 == 0 or number % 3 == 0:
          # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
          return False

     # All primes number are in format of 6k +/- 1
     for i in range(5		, int(math.sqrt(__UpperCamelCase) + 1)		, 6):
          if number % i == 0 or number % (i + 2) == 0:
               return False
     return True

def  SCREAMING_SNAKE_CASE							(       __UpperCamelCase = 0.1)      ->					int:
     a     =				3
     a     =				3

     while primes / (2 * j - 1) >= ratio:
          for i in range(j * j + j + 1		, (j + 2) * (j + 2)		, j + 1):
               primes += is_prime(__UpperCamelCase)
          j += 2
     return j


if __name__ == "__main__":
   import doctest

   doctest.testmod()

