



"""simple docstring"""
def        lowerCAmelCase_(   lowercase_     :							int							)	->       int:
				if n == 1 or not isinstance(lowercase_						,   lowercase_							):
								return 0
				elif n == 2:
								return 1
				else:
								_lowerCamelCase        =				[0, 1]
								for i in range(2						,   n + 1							):
												sequence.append(sequence[i - 1] + sequence[i - 2]							)

								return sequence[n]



def        lowerCAmelCase_(   lowercase_     :							int							)	->       int:
				_lowerCamelCase        =				0
				_lowerCamelCase        =				2

				while digits < n:
								index += 1
								_lowerCamelCase        =				len(str(fibonacci(lowercase_							)							)							)

				return index



def        lowerCAmelCase_(   lowercase_     :							int = 10_00							)	->       int:
				return fibonacci_digits_index(lowercase_							)


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





"""simple docstring"""
def        lowerCAmelCase_(   lowercase_     :							str						,   lowercase_     :							str							)	->       bool:
				_lowerCamelCase        =				len(lowercase_							)
				_lowerCamelCase        =				len(lowercase_							)
				_lowerCamelCase        =				[[False for _ in range(m + 1							)] for _ in range(n + 1							)]
				_lowerCamelCase        =				True
				for i in range(lowercase_							):
								for j in range(m + 1							):
												if dp[i][j]:
																if j < m and a[i].upper() == b[j]:
																				_lowerCamelCase        =				True
																if a[i].islower():
																				_lowerCamelCase        =				True
				return dp[n][m]


if __name__ == "__main__":
			import doctest

			doctest.testmod()
