



def 			lowerCAmelCase__	(					lowerCamelCase_	:	int):





				'''simple docstring'''

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

								return sequence[n]






def 			lowerCAmelCase__	(					lowerCamelCase_	:	int):





				'''simple docstring'''

				lowerCAmelCase__  :       Tuple				=  0
				lowerCAmelCase__  :       Any				=  2

				while digits < n:
								index += 1
								lowerCAmelCase__  :       str				=  len(str(fibonacci(lowerCamelCase_)))

				return index






def 			lowerCAmelCase__	(					lowerCamelCase_	:	int = 1000):





				'''simple docstring'''

				return fibonacci_digits_index(lowerCamelCase_)


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






from __future__ import annotations






def 			lowerCAmelCase__	(					lowerCamelCase_	:	list[int]):





				'''simple docstring'''

				return len(set(lowerCamelCase_)) == len(lowerCamelCase_)


if __name__ == "__main__":
							import doctest

							doctest.testmod()

