




'''simple docstring'''



from random import randint, random




def   lowercase__(			__UpperCamelCase:					int      ,__UpperCamelCase:					int      ,__UpperCamelCase:					int      ,__UpperCamelCase:					bool = False      ,__UpperCamelCase:					bool = False      ,__UpperCamelCase:					int = 5      ,):

      """simple docstring"""






      SCREAMING_SNAKE_CASE   :      Optional[int]    					=						[[-1] * number_of_cells]  # Create a highway without any car
      SCREAMING_SNAKE_CASE   :      int    					=						0
      SCREAMING_SNAKE_CASE   :      Dict    					=						max(__UpperCamelCase      ,0    )
      while i < number_of_cells:
            SCREAMING_SNAKE_CASE   :      int    					=						(
                randint(0      ,__UpperCamelCase    ) if random_speed else initial_speed
            )  # Place the cars
            i += (
                randint(1      ,max_speed * 2    ) if random_frequency else frequency
            )  # Arbitrary number, may need tuning
      return highway




def   lowercase__(			__UpperCamelCase:					list      ,__UpperCamelCase:					int    ):

      """simple docstring"""






      SCREAMING_SNAKE_CASE   :      Any    					=						0
      SCREAMING_SNAKE_CASE   :      List[Any]    					=						highway_now[car_index + 1 :]
      for cell in range(len(__UpperCamelCase    )    ):  # May need a better name for this
            if cells[cell] != -1:  # If the cell is not empty then
                  return distance  # we have the distance we wanted
            distance += 1
      # Here if the car is near the end of the highway
      return distance + get_distance(__UpperCamelCase      ,-1    )




def   lowercase__(			__UpperCamelCase:					list      ,__UpperCamelCase:					float      ,__UpperCamelCase:					int    ):

      """simple docstring"""






      SCREAMING_SNAKE_CASE   :      int    					=						len(__UpperCamelCase    )
      # Beforce calculations, the highway is empty
      SCREAMING_SNAKE_CASE   :      int    					=						[-1] * number_of_cells

      for car_index in range(__UpperCamelCase    ):
            if highway_now[car_index] != -1:
                  # Add 1 to the current speed of the car and cap the speed
                  SCREAMING_SNAKE_CASE   :      List[Any]    					=						min(highway_now[car_index] + 1      ,__UpperCamelCase    )
                  # Number of empty cell before the next car
                  SCREAMING_SNAKE_CASE   :      Dict    					=						get_distance(__UpperCamelCase      ,__UpperCamelCase    ) - 1
                  # We can't have the car causing an accident
                  SCREAMING_SNAKE_CASE   :      Dict    					=						min(next_highway[car_index]      ,__UpperCamelCase    )
                  if random() < probability:
                        # Randomly, a driver will slow down
                        SCREAMING_SNAKE_CASE   :      List[str]    					=						max(next_highway[car_index] - 1      ,0    )
      return next_highway




def   lowercase__(			__UpperCamelCase:					list      ,__UpperCamelCase:					int      ,__UpperCamelCase:					float      ,__UpperCamelCase:					int    ):

      """simple docstring"""






      SCREAMING_SNAKE_CASE   :      List[Any]    					=						len(highway[0]    )

      for i in range(__UpperCamelCase    ):
            SCREAMING_SNAKE_CASE   :      Optional[Any]    					=						update(highway[i]      ,__UpperCamelCase      ,__UpperCamelCase    )
            SCREAMING_SNAKE_CASE   :      Tuple    					=						[-1] * number_of_cells

            for car_index in range(__UpperCamelCase    ):
                  SCREAMING_SNAKE_CASE   :      int    					=						next_speeds_calculated[car_index]
                  if speed != -1:
                        # Change the position based on the speed (with % to create the loop)
                        SCREAMING_SNAKE_CASE   :      Union[str, Any]    					=						(car_index + speed) % number_of_cells
                        # Commit the change of position
                        SCREAMING_SNAKE_CASE   :      List[Any]    					=						speed
            highway.append(__UpperCamelCase    )

      return highway


if __name__ == "__main__":
      import doctest

      doctest.testmod()





'''simple docstring'''

def 					__UpperCamelCase				(						lowercase__    :	int			):






     '''simple docstring'''





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

          return sequence[n]

def 					__UpperCamelCase				(						lowercase__    :	int			):






     '''simple docstring'''





     __lowercase      		=0
     __lowercase      		=2

     while digits < n:
          index += 1
          __lowercase      		=len(str(fibonacci(lowercase__			)			)			)

     return index

def 					__UpperCamelCase				(						lowercase__    :	int = 10_00			):






     '''simple docstring'''





     return fibonacci_digits_index(lowercase__			)


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


