

'''simple docstring'''

def 					__UpperCamelCase				(						lowercase__    :	list[int]			):






     '''simple docstring'''





     if not numbers:
          return 0

     if not isinstance(lowercase__,       (list, tuple)			) or not all(
         isinstance(lowercase__,       lowercase__			) for number in numbers			):
          raise ValueError('numbers must be an iterable of integers'			)

     __lowercase      		=__lowercase      		=__lowercase      		=numbers[0]

     for i in range(1,       len(lowercase__			)			):
          # update the maximum and minimum subarray products
          __lowercase      		=numbers[i]
          if number < 0:
               __lowercase		,  __lowercase      		=min_till_now, max_till_now
          __lowercase      		=max(lowercase__,       max_till_now * number			)
          __lowercase      		=min(lowercase__,       min_till_now * number			)

          # update the maximum product found till now
          __lowercase      		=max(lowercase__,       lowercase__			)

     return max_prod





'''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())))


