





"""simple docstring"""




def 					_A	(		SCREAMING_SNAKE_CASE					:       int						):





  """simple docstring"""



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

    return sequence[n]
def 					_A	(		SCREAMING_SNAKE_CASE					:       int						):





  """simple docstring"""



  a__     : Any  =0
  a__     : List[Any]  =2

  while digits < n:
    index += 1
    a__     : List[str]  =len(str(fibonacci(SCREAMING_SNAKE_CASE						)						)						)

  return index
def 					_A	(		SCREAMING_SNAKE_CASE					:       int = 1_000						):





  """simple docstring"""



  return fibonacci_digits_index(SCREAMING_SNAKE_CASE						)


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













from __future__ import annotations

import math
def 					_A	(		SCREAMING_SNAKE_CASE					:       int						):





  """simple docstring"""



  if num <= 0:
    a__     : List[str]  =f'''{num}: Invalid input, please enter a positive integer.'''
    raise ValueError(SCREAMING_SNAKE_CASE						)

  a__     : Union[str, Any]  =[True] * (num + 1)
  a__     : Union[str, Any]  =[]
  a__     : str  =2
  a__     : Any  =int(math.sqrt(SCREAMING_SNAKE_CASE						)						)

  while start <= end:
    # If start is a prime
    if sieve[start] is True:
      prime.append(SCREAMING_SNAKE_CASE						)

      # Set multiples of start be False
      for i in range(start * start	,	num + 1	,	SCREAMING_SNAKE_CASE						):
        if sieve[i] is True:
          a__     : Optional[int]  =False

    start += 1

  for j in range(end + 1	,	num + 1						):
    if sieve[j] is True:
      prime.append(SCREAMING_SNAKE_CASE						)

  return prime


if __name__ == "__main__":
     print(prime_sieve(int(input("""Enter a positive integer: """).strip())))






