
from math import factorial

def 		UpperCamelCase						(   lowercase_ = 20 )		->						int:


  '''simple docstring'''






  lowercase__	: Tuple     		=   2 * n  # middle entry of odd rows starting at row 3 is the solution for n = 1,
  # 2, 3,...
  lowercase__	: Union[str, Any]     		=   n // 2

  return int(factorial(lowercase_ ) / (factorial(lowercase_ ) * factorial(n - k )) )


if __name__ == "__main__":
     import sys

     if len(sys.argv) == 1:
          print(solution(2_0))
     else:
          try:
               lowerCamelCase__     :		Any        = int(sys.argv[1])
               print(solution(n))
          except ValueError:
               print("""Invalid entry - please enter a number.""")








def 		UpperCamelCase						(   lowercase_ )		->						int:


  '''simple docstring'''






  if n == 1 or not isinstance(lowercase_			,			lowercase_ ):
    return 0
  elif n == 2:
    return 1
  else:
    lowercase__	: List[Any]     		=   [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__	: Optional[Any]     		=   0
  lowercase__	: Dict     		=   2

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

  return index

def 		UpperCamelCase						(   lowercase_ = 10_00 )		->						int:


  '''simple docstring'''






  return fibonacci_digits_index(lowercase_ )


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






