






"""simple docstring"""
def 							A						(				__snake_case: int  )    ->		int:

       """simple docstring"""





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

              return sequence[n]


def 							A						(				__snake_case: int  )    ->		int:

       """simple docstring"""





       __magic_name__      				=    0
       __magic_name__      				=    2

       while digits < n:
              index += 1
              __magic_name__      				=    len(str(fibonacci(__snake_case  )  )  )

       return index


def 							A						(				__snake_case: int = 1_0_0_0  )    ->		int:

       """simple docstring"""





       return fibonacci_digits_index(__snake_case  )


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







"""simple docstring"""
def 							A						(				__snake_case: str  )    ->		list:

       """simple docstring"""





       return [
           txt[:a] + txt[a].upper() + txt[a + 1 :]
           for a in range(len(__snake_case  )  )
           if txt[a].isalpha()
       ]


if __name__ == "__main__":
 __import__("""doctest""").testmod()