'''simple docstring'''




from __future__ import annotations

import time

import numpy as np

__SCREAMING_SNAKE_CASE       :     Optional[Any]     =  [8, 5, 9, 7]
__SCREAMING_SNAKE_CASE       :     Optional[int]     =  [
    [2, 0, 1, 1],
    [0, 1, 2, 1],
    [4, 0, 0, 3],
    [0, 2, 1, 0],
    [1, 0, 3, 0],
]
__SCREAMING_SNAKE_CASE       :     List[Any]     =  [
    [3, 2, 1, 4],
    [0, 2, 5, 2],
    [5, 1, 0, 5],
    [1, 5, 3, 0],
    [3, 0, 3, 3],
]

class 	lowerCamelCase_	:
      '''simple docstring'''

      def __init__(       self						:				str						,					A						:				list[int]						,					A						:				list[list[int]]						,					A						:				list[list[int]]						,					):
             _UpperCAmelCase     :  List[str]							      =    claim_vector
             _UpperCAmelCase     :  Optional[Any]							      =    allocated_resources_table
             _UpperCAmelCase     :  Any							      =    maximum_claim_table




      def      _A	(       self						:				Union[str, Any]       ):
             return [
                 sum(p_item[i] for p_item in self.__allocated_resources_table       )
                 for i in range(len(self.__allocated_resources_table[0]       )       )
             ]




      def      _A	(       self						:				List[Any]       ):
             return np.array(self.__claim_vector       ) - np.array(
                 self.__processes_resource_summation()       )




      def      _A	(       self						:				str       ):
             return [
                 list(np.array(self.__maximum_claim_table[i]       ) - np.array(A       )       )
                 for i, allocated_resource in enumerate(self.__allocated_resources_table       )
             ]




      def      _A	(       self						:				Dict       ):
             return {self.__need().index(A       ): i for i in self.__need()}




      def      _A	(       self						:				str						,					**A						:				Optional[int]       ):
             _UpperCAmelCase     :  str							      =    self.__need()
             _UpperCAmelCase     :  Tuple							      =    self.__allocated_resources_table
             _UpperCAmelCase     :  Tuple							      =    self.__available_resources()
             _UpperCAmelCase     :  Any							      =    self.__need_index_manager()
             for kw, val in kwargs.items():
                    if kw and val is True:
                           self.__pretty_data()
             print("_" * 50 + "\n"       )
             while need_list:
                    _UpperCAmelCase     :  Dict							      =    False
                    for each_need in need_list:
                           _UpperCAmelCase     :  Optional[Any]							      =    True
                           for index, need in enumerate(A       ):
                                  if need > available_resources[index]:
                                         _UpperCAmelCase     :  Optional[int]							      =    False
                                         break
                           if execution:
                                  _UpperCAmelCase     :  Dict							      =    True
                                  # get the original index of the process from ind_ctrl db
                                  for original_need_index, need_clone in need_index_manager.items():
                                         if each_need == need_clone:
                                                _UpperCAmelCase     :  Tuple							      =    original_need_index
                                  print(F"""Process {process_number + 1} is executing."""       )
                                  # remove the process run from stack
                                  need_list.remove(A       )
                                  # update available/freed resources stack
                                  _UpperCAmelCase     :  Tuple							      =    np.array(A       ) + np.array(
                                      alloc_resources_table[process_number]       )
                                  print(
                                      "Updated available resource stack for processes: "
                                      + " ".join([str(A       ) for x in available_resources]       )       )
                                  break
                    if safe:
                           print("The process is in a safe state.\n"       )
                    else:
                           print("System in unsafe state. Aborting...\n"       )
                           break





      def      _A	(       self						:				Tuple       ):
             print(" " * 9 + "Allocated Resource Table"       )
             for item in self.__allocated_resources_table:
                    print(
                        F"""P{self.__allocated_resources_table.index(A       ) + 1}"""
                        + " ".join(F"""{it:>8}""" for it in item       )
                        + "\n"       )
             print(" " * 9 + "System Resource Table"       )
             for item in self.__maximum_claim_table:
                    print(
                        F"""P{self.__maximum_claim_table.index(A       ) + 1}"""
                        + " ".join(F"""{it:>8}""" for it in item       )
                        + "\n"       )
             print(
                 "Current Usage by Active Processes: "
                 + " ".join(str(A       ) for x in self.__claim_vector       )       )
             print(
                 "Initial Available Resources:       "
                 + " ".join(str(A       ) for x in self.__available_resources()       )       )
             time.sleep(1       )


if __name__ == "__main__":
  import doctest

  doctest.testmod()


def    a__       (						__UpperCamelCase ):
      if n == 1 or not isinstance(__UpperCamelCase   ,					__UpperCamelCase ):
            return 0
      elif n == 2:
            return 1
      else:
            SCREAMING_SNAKE_CASE_      =     [0, 1]
            for i in range(2   ,					n + 1 ):
                  sequence.append(sequence[i - 1] + sequence[i - 2] )

            return sequence[n]


def    a__       (						__UpperCamelCase ):
      SCREAMING_SNAKE_CASE_      =     0
      SCREAMING_SNAKE_CASE_      =     2

      while digits < n:
            index += 1
            SCREAMING_SNAKE_CASE_      =     len(str(fibonacci(__UpperCamelCase ) ) )

      return index


def    a__       (						__UpperCamelCase = 1_0_0_0 ):
      return fibonacci_digits_index(__UpperCamelCase )


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


