



from __future__ import annotations







def  lowerCAmelCase_	(lowerCAmelCase__:		int | float | str		,						lowerCAmelCase__:		int | float | str  ):





			"""simple docstring"""


			if nth_term == "":
						return [""]
			UpperCAmelCase_:		List[Any]							      =     int(lowerCAmelCase__  )
			UpperCAmelCase_:		Any							      =     int(lowerCAmelCase__  )
			UpperCAmelCase_:		list[str]							      =     []
			for temp in range(int(lowerCAmelCase__  )  ):
						series.append(F'1 / {pow(temp + 1		,						int(lowerCAmelCase__  )  )}' if series else """1"""  )
			return series


if __name__ == "__main__":
	import doctest

	doctest.testmod()

	a      :  Optional[int]			     =			int(input('Enter the last number (nth term) of the P-Series'))
	a      :  List[Any]			     =			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))











def  lowerCAmelCase_	(lowerCAmelCase__:		int  ):





			"""simple docstring"""


			if n == 1 or not isinstance(lowerCAmelCase__		,						lowerCAmelCase__  ):
						return 0
			elif n == 2:
						return 1
			else:
						UpperCAmelCase_:		Optional[int]							      =     [0, 1]
						for i in range(2		,						n + 1  ):
									sequence.append(sequence[i - 1] + sequence[i - 2]  )

						return sequence[n]







def  lowerCAmelCase_	(lowerCAmelCase__:		int  ):





			"""simple docstring"""


			UpperCAmelCase_:		str							      =     0
			UpperCAmelCase_:		str							      =     2

			while digits < n:
						index += 1
						UpperCAmelCase_:		Union[str, Any]							      =     len(str(fibonacci(lowerCAmelCase__  )  )  )

			return index







def  lowerCAmelCase_	(lowerCAmelCase__:		int = 1_0_0_0  ):





			"""simple docstring"""


			return fibonacci_digits_index(lowerCAmelCase__  )


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






