
from functools import lru_cache

def 		UpperCamelCase						(   lowercase_ )		->						set:


  '''simple docstring'''






  lowercase__	: Any     		=   2
  lowercase__	: List[str]     		=   set()
  while i * i <= n:
    if n % i:
      i += 1
    else:
      n //= i
      factors.add(lowercase_ )
  if n > 1:
    factors.add(lowercase_ )
  return factors

@lru_cache
def 		UpperCamelCase						(   lowercase_ )		->						int:


  '''simple docstring'''






  return len(unique_prime_factors(lowercase_ ) )

def 		UpperCamelCase						(   lowercase_ )		->						bool:


  '''simple docstring'''






  return len(set(lowercase_ ) ) in (0, 1)

def 		UpperCamelCase						(   lowercase_ )		->						list:


  '''simple docstring'''






  lowercase__	: Optional[Any]     		=   2

  while True:
    # Increment each value of a generated range
    lowercase__	: int     		=   [base + i for i in range(lowercase_ )]

    # Run elements through out unique_prime_factors function
    # Append our target number to the end.
    lowercase__	: Optional[Any]     		=   [upf_len(lowercase_ ) for x in group]
    checker.append(lowercase_ )

    # If all numbers in the list are equal, return the group variable.
    if equality(lowercase_ ):
      return group

    # Increment our base variable by 1
    base += 1

def 		UpperCamelCase						(   lowercase_ = 4 )		->						int:


  '''simple docstring'''






  lowercase__	: Any     		=   run(lowercase_ )
  return results[0] if len(lowercase_ ) else None


if __name__ == "__main__":
     print(solution())








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






