

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

            return sequence[n]






def 					__lowercase      (     _A			)     ->						int:
      SCREAMING_SNAKE_CASE :      Dict       =   0
      SCREAMING_SNAKE_CASE :      Optional[Any]       =   2

      while digits < n:
            index += 1
            SCREAMING_SNAKE_CASE :      Dict       =   len(str(fibonacci(_A			)			)			)

      return index






def 					__lowercase      (     _A = 1000			)     ->						int:
      return fibonacci_digits_index(_A			)


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







from __future__ import annotations






def 					__lowercase      (     _A						,    _A			)     ->						list[str]:
      if nth_term == "":
            return [""]
      SCREAMING_SNAKE_CASE :      Optional[Any]       =   int(_A			)
      SCREAMING_SNAKE_CASE :      Optional[int]       =   int(_A			)
      SCREAMING_SNAKE_CASE :      list[str]       =   []
      for temp in range(int(_A			)			):
            series.append(F"1 / {pow(temp + 1						,    int(_A			)			)}" if series else """1"""			)
      return series


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  UpperCAmelCase__ :     Dict				    =    int(input("""Enter the last number (nth term) of the P-Series"""))
  UpperCAmelCase__ :     Optional[int]				    =    int(input("""Enter the power for  P-Series"""))
  print("""Formula of P-Series => 1+1/2^p+1/3^p ..... 1/n^p""")
  print(p_series(nth_term, power))




