



'''simple docstring'''


from __future__ import annotations

import collections
import pprint
from pathlib import Path







def 							__lowerCamelCase							(  A__       )			->      str:






   """simple docstring"""
   return "".join(sorted(__A       )       )







def 							__lowerCamelCase							(  A__       )			->      list[str]:






   """simple docstring"""
   return word_by_signature[signature(__A       )]


_lowerCamelCase      :			str       =      Path(__file__).parent.joinpath("words.txt").read_text(encoding="utf-8")
_lowerCamelCase      :			Optional[Any]       =      sorted({word.strip().lower() for word in data.splitlines()})

_lowerCamelCase      :			Union[str, Any]       =      collections.defaultdict(list)
for word in word_list:
   word_by_signature[signature(word)].append(word)

if __name__ == "__main__":
   _lowerCamelCase      :			Tuple       =      {word: anagram(word) for word in word_list if len(anagram(word)) > 1}

   with open("anagrams.txt", "w") as file:
      file.write("all_anagrams = \n ")
      file.write(pprint.pformat(all_anagrams))









'''simple docstring'''



def 				lowercase_					(     __A			:							int      )							->   int:



 """simple docstring"""




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

  return sequence[n]


def 				lowercase_					(     __A			:							int      )							->   int:



 """simple docstring"""




 lowercase       : List[str]						=0
 lowercase       : str						=2

 while digits < n:
  index += 1
  lowercase       : int						=len(str(fibonacci(__A      )      )      )

 return index


def 				lowercase_					(     __A			:							int = 1_0_0_0      )							->   int:



 """simple docstring"""




 return fibonacci_digits_index(__A      )


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



