


'''simple docstring'''


def      lowerCamelCase					(      lowerCamelCase  :      int):
      if n == 1 or not isinstance(lowerCamelCase							,						lowerCamelCase):
            return 0
      elif n == 2:
            return 1
      else:
            A_						:  List[str]          =				[0, 1]
            for i in range(2							,						n + 1):
                  sequence.append(sequence[i - 1] + sequence[i - 2])

            return sequence[n]




def      lowerCamelCase					(      lowerCamelCase  :      int):
      A_						:  List[Any]          =				0
      A_						:  Any          =				2

      while digits < n:
            index += 1
            A_						:  str          =				len(str(fibonacci(lowerCamelCase)))

      return index




def      lowerCamelCase					(      lowerCamelCase  :      int = 1000):
      return fibonacci_digits_index(lowerCamelCase)


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




'''simple docstring'''


from ..utils import DummyObject, requires_backends



class 	__lowerCAmelCase		(							metaclass=__SCREAMING_SNAKE_CASE    ):


  '''simple docstring'''







  a_  					=							["""torch""", """torchsde"""]






  def __init__(							self :       Any	,*_a :       Union[str, Any]	,**_a :       Optional[int] ):

        '''simple docstring'''




        requires_backends(self	,["""torch""", """torchsde"""] )






  @classmethod
  def        _a							(							cls :       Optional[int]	,*_a :       List[Any]	,**_a :       Any ):

        '''simple docstring'''




        requires_backends(cls	,["""torch""", """torchsde"""] )






  @classmethod
  def        _a							(							cls :       List[Any]	,*_a :       Tuple	,**_a :       Union[str, Any] ):

        '''simple docstring'''




        requires_backends(cls	,["""torch""", """torchsde"""] )
