


def        snake_case_					(  snake_case = 4_00_00_00					)  ->    int:
							lowercase__:       Tuple        =       [0, 1]
							lowercase__:       Union[str, Any]        =       0
							while fib[i] <= n:
														fib.append(fib[i] + fib[i + 1]					)
														if fib[i + 2] > n:
																					break
														i += 1
							lowercase__:       Tuple        =       0
							for j in range(len(_lowerCamelCase					) - 1					):
														if fib[j] % 2 == 0:
																					total += fib[j]

							return total


if __name__ == "__main__":
	print(F'''{solution() = }''')






from __future__ import annotations




def        snake_case_					(  snake_case      ,							snake_case					)  ->    list[str]:
       if nth_term == "":
              return [""]
       lowercase__:       Tuple        =       int(snake_case					)
       lowercase__:       int        =       int(snake_case					)
       lowercase__:       list[str]        =       []
       for temp in range(int(snake_case					)					):
              series.append(f'1 / {pow(temp + 1      ,							int(snake_case					)					)}' if series else '1'					)
       return series


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 __lowerCAmelCase			=							int(input('''Enter the last number (nth term) of the P-Series'''))
 __lowerCAmelCase			=							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))


