

"""simple docstring"""






def   lowercase_	(    _lowercase       :		int	):




					'''simple docstring'''






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

										return sequence[n]



def   lowercase_	(    _lowercase       :		int	):




					'''simple docstring'''






					UpperCAmelCase			:   List[Any]      =				0
					UpperCAmelCase			:   Optional[Any]      =				2

					while digits < n:
										index += 1
										UpperCAmelCase			:   Dict      =				len(str(fibonacci(_lowercase	)	)	)

					return index



def   lowercase_	(    _lowercase       :		int = 10_00	):




					'''simple docstring'''






					return fibonacci_digits_index(_lowercase	)


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





"""simple docstring"""






import math



def   lowercase_	(    _lowercase       :		int	):




					'''simple docstring'''






					return math.sqrt(_lowercase	) * math.sqrt(_lowercase	) == num



def   lowercase_	(    _lowercase       :		int	):




					'''simple docstring'''






					UpperCAmelCase			:   List[Any]      =				0
					UpperCAmelCase			:   Tuple      =				n
					while left <= right:
										UpperCAmelCase			:   Tuple      =				(left + right) // 2
										if mid**2 == n:
															return True
										elif mid**2 > n:
															UpperCAmelCase			:   List[str]      =				mid - 1
										else:
															UpperCAmelCase			:   Any      =				mid + 1
					return False


if __name__ == "__main__":
	import doctest

	doctest.testmod()


