






def   snake_case (UpperCAmelCase__  )	->    int:
  if n == 1 or not isinstance(UpperCAmelCase__     ,   UpperCAmelCase__  ):
    return 0
  elif n == 2:
    return 1
  else:
    UpperCamelCase_: Optional[int]   				=    [0, 1]
    for i in range(2     ,   n + 1  ):
      sequence.append(sequence[i - 1] + sequence[i - 2]  )

    return sequence[n]

def   snake_case (UpperCAmelCase__  )	->    int:
  UpperCamelCase_: List[str]   				=    0
  UpperCamelCase_: int   				=    2

  while digits < n:
    index += 1
    UpperCamelCase_: str   				=    len(str(fibonacci(UpperCAmelCase__  )  )  )

  return index

def   snake_case (UpperCAmelCase__ = 1_0_0_0  )	->    int:
  return fibonacci_digits_index(UpperCAmelCase__  )


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







def   snake_case (UpperCAmelCase__  )	->    int:
  assert isinstance(UpperCAmelCase__     ,   UpperCAmelCase__  ), F'''The input value of [n={number}] is not an integer'''

  if number == 1:
    return 2
  elif number < 1:
    UpperCamelCase_: List[Any]   				=    F'''The input value of [n={number}] has to be > 0'''
    raise ValueError(UpperCAmelCase__  )
  else:
    UpperCamelCase_: str   				=    sylvester(number - 1  )
    UpperCamelCase_: str   				=    num - 1
    UpperCamelCase_: Any   				=    num
    return lower * upper + 1


if __name__ == "__main__":
   print(F'''The 8th number in Sylvester\'s sequence: {sylvester(8)}''')