



'''simple docstring'''

def      __lowerCamelCase     (      lowerCAmelCase_  )			->      int:
		if n == 1 or not isinstance(lowerCAmelCase_						,			lowerCAmelCase_  ):
				return 0
		elif n == 2:
				return 1
		else:
				_a     :      Union[str, Any]        =							[0, 1]
				for i in range(2						,			n + 1  ):
						sequence.append(sequence[i - 1] + sequence[i - 2]  )

				return sequence[n]



def      __lowerCamelCase     (      lowerCAmelCase_  )			->      int:
		_a     :      Optional[int]        =							0
		_a     :      str        =							2

		while digits < n:
				index += 1
				_a     :      Optional[int]        =							len(str(fibonacci(lowerCAmelCase_  )  )  )

		return index



def      __lowerCamelCase     (      lowerCAmelCase_ = 1000  )			->      int:
		return fibonacci_digits_index(lowerCAmelCase_  )


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








from __future__ import annotations

from typing import Any

def       lowercase_		(		_A			:    list[Any]						):

      """simple docstring"""




      create_state_space_tree(_A    ,					[]    ,					0						)

def       lowercase_		(		_A			:    list[Any]    ,					_A			:    list[Any]    ,					_A			:    int						):

      """simple docstring"""




      if index == len(_A						):
            print(_A						)
            return

      create_state_space_tree(_A    ,					_A    ,					index + 1						)
      current_subsequence.append(sequence[index]						)
      create_state_space_tree(_A    ,					_A    ,					index + 1						)
      current_subsequence.pop()


if __name__ == "__main__":
    A      :    list[Any]		=					[3, 1, 2, 4]
    generate_all_subsequences(seq)

    seq.clear()
    seq.extend(["A", "B", "C"])
    generate_all_subsequences(seq)


