


'''simple docstring'''






def     UpperCamelCase_      (   A__ :       int ):
  '''simple docstring'''





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

    return sequence[n]







def     UpperCamelCase_      (   A__ :       int ):
  '''simple docstring'''





  lowerCAmelCase_      :				Optional[Any]      =       0
  lowerCAmelCase_      :				Optional[Any]      =       2

  while digits < n:
    index += 1
    lowerCAmelCase_      :				Optional[Any]      =       len(str(fibonacci(A__ ) ) )

  return index







def     UpperCamelCase_      (   A__ :       int = 10_00 ):
  '''simple docstring'''





  return fibonacci_digits_index(A__ )


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







'''simple docstring'''






from ..utils import DummyObject, requires_backends






class        __snake_case	(       metaclass=_SCREAMING_SNAKE_CASE):







    """simple docstring"""



    lowercase       			= ['note_seq']

    def __init__(       self   :  Tuple   ,						*lowerCamelCase   :  Optional[int]   ,						**lowerCamelCase   :  Tuple		)       ->  Any:
      requires_backends(self   ,						["""note_seq"""]		)

    @classmethod
    def __lowercase       (       cls   :  Optional[Any]   ,						*lowerCamelCase   :  List[Any]   ,						**lowerCamelCase   :  Dict		)       ->  List[Any]:
      requires_backends(cls   ,						["""note_seq"""]		)





    @classmethod
    def __lowercase       (       cls   :  Union[str, Any]   ,						*lowerCamelCase   :  Union[str, Any]   ,						**lowerCamelCase   :  List[Any]		)       ->  Optional[int]:
      requires_backends(cls   ,						["""note_seq"""]		)



