





'''simple docstring'''






def      __A						(							a_						:  int	):
  if n == 1 or not isinstance(a_      ,a_	):
    return 0
  elif n == 2:
    return 1
  else:
    lowerCAmelCase     :    List[str]						=   [0, 1]
    for i in range(2      ,n + 1	):
      sequence.append(sequence[i - 1] + sequence[i - 2]	)

    return sequence[n]






def      __A						(							a_						:  int	):
  lowerCAmelCase     :    List[Any]						=   0
  lowerCAmelCase     :    Any						=   2

  while digits < n:
    index += 1
    lowerCAmelCase     :    str						=   len(str(fibonacci(a_	)	)	)

  return index






def      __A						(							a_						:  int = 1_0_0_0	):
  return fibonacci_digits_index(a_	)


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










'''simple docstring'''






def      __A						(							a_						:  int      ,a_						:  int	):
		return abs(a_	) if a == 0 else greatest_common_divisor(b % a      ,a_	)






def      __A						(							a_						:  int      ,a_						:  int	):
		while y:  # --> when y=0 then loop will terminate and return x as final GCD.
				lowerCAmelCase	,		lowerCAmelCase     :    Tuple						=   y, x % y
		return abs(a_	)






def      __A						(							):
		try:
				lowerCAmelCase     :    Tuple						=   input("Enter two integers separated by comma (,): "	).split(","	)
				lowerCAmelCase     :    Tuple						=   int(nums[0]	)
				lowerCAmelCase     :    Tuple						=   int(nums[1]	)
				print(
				    f'''greatest_common_divisor({num_a}, {num_a}) = '''
				    f'''{greatest_common_divisor(a_      ,a_	)}'''	)
				print(f'''By iterative gcd({num_a}, {num_a}) = {gcd_by_iterative(a_      ,a_	)}'''	)
		except (IndexError, UnboundLocalError, ValueError):
				print("Wrong input"	)


if __name__ == "__main__":
					main()



