



'''simple docstring'''


import argparse
import logging
import pickle
from collections import Counter


logging.basicConfig(
    format="%(asctime)s - %(levelname)s - %(name)s - %(message)s", datefmt="%m/%d/%Y %H:%M:%S", level=logging.INFO
)
_lowerCamelCase      :			Tuple       =      logging.getLogger(__name__)

if __name__ == "__main__":
   _lowerCamelCase      :			Optional[int]       =      argparse.ArgumentParser(
       description="Token Counts for smoothing the masking probabilities in MLM (cf XLM/word2vec)"
   )
   parser.add_argument(
       "--data_file", type=str, default="data/dump.bert-base-uncased.pickle", help="The binarized dataset."
   )
   parser.add_argument(
       "--token_counts_dump", type=str, default="data/token_counts.bert-base-uncased.pickle", help="The dump file."
   )
   parser.add_argument("--vocab_size", default=3_0522, type=int)
   _lowerCamelCase      :			int       =      parser.parse_args()

   logger.info(f'''Loading data from {args.data_file}''')
   with open(args.data_file, "rb") as fp:
      _lowerCamelCase      :			str       =      pickle.load(fp)

   logger.info("Counting occurrences for MLM.")
   _lowerCamelCase      :			List[str]       =      Counter()
   for tk_ids in data:
      counter.update(tk_ids)
   _lowerCamelCase      :			Tuple       =      [0] * args.vocab_size
   for k, v in counter.items():
      _lowerCamelCase      :			str       =      v

   logger.info(f'''Dump to {args.token_counts_dump}''')
   with open(args.token_counts_dump, "wb") as handle:
      pickle.dump(counts, handle, protocol=pickle.HIGHEST_PROTOCOL)









'''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())))



