






"""simple docstring"""



from __future__ import annotations



def 						lowercase    (				__snake_case				: list[int]		,					__snake_case				: int	):
		if len(__snake_case	) == 0:
				return False
		lowercase_ : int							       =   len(__snake_case	) // 2
		if a_list[midpoint] == item:
				return True
		if item < a_list[midpoint]:
				return binary_search(a_list[:midpoint]		,					__snake_case	)
		else:
				return binary_search(a_list[midpoint + 1 :]		,					__snake_case	)


if __name__ == "__main__":
						__A		:       Tuple  				=		input('''Enter numbers separated by comma:\n''').strip()
						__A		:       List[Any]  				=		[int(item.strip()) for item in user_input.split(''',''')]
						__A		:       str  				=		int(input('''Enter the number to be found in the list:\n''').strip())
						__A		:       Union[str, Any]  				=		'''''' if binary_search(sequence, target) else '''not '''
						print(F"""{target} was {not_str}found in {sequence}""")











"""simple docstring"""



def 						lowercase    (				__snake_case				: int	):
		if n == 1 or not isinstance(__snake_case		,					__snake_case	):
				return 0
		elif n == 2:
				return 1
		else:
				lowercase_ : Dict							       =   [0, 1]
				for i in range(2		,					n + 1	):
						sequence.append(sequence[i - 1] + sequence[i - 2]	)

				return sequence[n]



def 						lowercase    (				__snake_case				: int	):
		lowercase_ : str							       =   0
		lowercase_ : List[str]							       =   2

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

		return index



def 						lowercase    (				__snake_case				: int = 1_0_0_0	):
		return fibonacci_digits_index(__snake_case	)


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



