




'''simple docstring'''


from __future__ import annotations
def 	snake_case_					(UpperCamelCase :						int | float | str				,		UpperCamelCase :						int | float | str   ):





							'''simple docstring'''


							if nth_term == "":
														return [""]
							_a			  =       int(UpperCamelCase   )
							_a			  =       int(UpperCamelCase   )
							_a			  =       []
							for temp in range(int(UpperCamelCase   )   ):
														series.append(f'1 / {pow(temp + 1				,		int(UpperCamelCase   )   )}' if series else '''1'''   )
							return series


if __name__ == "__main__":
				import doctest

				doctest.testmod()

				_snake_case   :   Union[str, Any]     							=	int(input('Enter the last number (nth term) of the P-Series'))
				_snake_case   :   Dict     							=	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))







'''simple docstring'''


def 	snake_case_					(UpperCamelCase :						int   ):





							'''simple docstring'''


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

														return sequence[n]
def 	snake_case_					(UpperCamelCase :						int   ):





							'''simple docstring'''


							_a			  =       0
							_a			  =       2

							while digits < n:
														index += 1
														_a			  =       len(str(fibonacci(UpperCamelCase   )   )   )

							return index
def 	snake_case_					(UpperCamelCase :						int = 1000   ):





							'''simple docstring'''


							return fibonacci_digits_index(UpperCamelCase   )


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

