



'''simple docstring'''


from collections import deque

from .hash_table import HashTable

class 					SCREAMING_SNAKE_CASE					(    __A						):






    """simple docstring"""





    def __init__(    self :   Tuple    ,		*UpperCamelCase__ :   List[Any]    ,		**UpperCamelCase__ :   Dict					):


       """simple docstring"""







       super().__init__(*UpperCamelCase__    ,		**UpperCamelCase__					)






    def 					A			(    self :   Tuple    ,		UpperCamelCase__ :   int    ,		UpperCamelCase__ :   Dict					):


       """simple docstring"""







       UpperCamelCase      							=    deque([]					) if self.values[key] is None else self.values[key]
       self.values[key].appendleft(UpperCamelCase__					)
       UpperCamelCase      							=    self.values[key]






    def 					A			(    self :   str					):


       """simple docstring"""







       return (
           sum(self.charge_factor - len(UpperCamelCase__					) for slot in self.values					)
           / self.size_table
           * self.charge_factor
       )






    def 					A			(    self :   Union[str, Any]    ,		UpperCamelCase__ :   Dict    ,		UpperCamelCase__ :   List[Any]=None					):


       """simple docstring"""







       if not (
           len(self.values[key]					) == self.charge_factor and self.values.count(UpperCamelCase__					) == 0
       ):
          return key
       return super()._collision_resolution(UpperCamelCase__    ,		UpperCamelCase__					)









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



