





def 	A_       (  _lowerCAmelCase  )		->				int:
 if n == 1 or not isinstance(_lowerCAmelCase							,     _lowerCAmelCase  ):
  return 0
 elif n == 2:
  return 1
 else:
  UpperCamelCase			:      Tuple 			=     [0, 1]
  for i in range(2							,     n + 1  ):
   sequence.append(sequence[i - 1] + sequence[i - 2]  )

  return sequence[n]



def 	A_       (  _lowerCAmelCase  )		->				int:
 UpperCamelCase			:      Optional[Any] 			=     0
 UpperCamelCase			:      Optional[Any] 			=     2

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

 return index



def 	A_       (  _lowerCAmelCase = 1000  )		->				int:
 return fibonacci_digits_index(_lowerCAmelCase  )


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







def 	A_       (  _lowerCAmelCase							,     _lowerCAmelCase  )		->				int:
 return int(input_a == input_a == 0  )



def 	A_       (  )		->				None:
 print("Truth Table of NOR Gate:"  )
 print("|   Input 1   |  Input 2  | Output |"  )
 print(F"""|      0      |    0      |  {nor_gate(0							,     0  )}     |"""  )
 print(F"""|      0      |    1      |  {nor_gate(0							,     1  )}     |"""  )
 print(F"""|      1      |    0      |  {nor_gate(1							,     0  )}     |"""  )
 print(F"""|      1      |    1      |  {nor_gate(1							,     1  )}     |"""  )


if __name__ == "__main__":
    import doctest

    doctest.testmod()
    main()
