


"""simple docstring"""




from __future__ import annotations





def       a_ (	lowercase__ :int | float | str,			lowercase__ :int | float | str     ):
			if nth_term == "":
						return [""]
			__lowerCamelCase          =      int(lowercase__     )
			__lowerCamelCase          =      int(lowercase__     )
			__lowerCamelCase          =      []
			for temp in range(int(lowercase__     )     ):
						series.append(f'1 / {pow(temp + 1,			int(lowercase__     )     )}' if series else """1"""     )
			return series


if __name__ == "__main__":
					import doctest

					doctest.testmod()

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




from collections import defaultdict





def       a_ (	lowercase__ :int     ):
			__lowerCamelCase          =      1
			__lowerCamelCase          =      True
			for v in tree[start]:
						if v not in visited:
									ret += dfs(lowercase__     )
			if ret % 2 == 0:
						cuts.append(lowercase__     )
			return ret





def       a_ (	):
			dfs(1     )


if __name__ == "__main__":
					__magic_name__  , __magic_name__						: Tuple    =				1_0, 9
					__magic_name__						: Tuple    =				defaultdict(list)
					__magic_name__						: dict[int, bool]    =				{}
					__magic_name__						: list[int]    =				[]
					__magic_name__						: List[str]    =				0
					__magic_name__						: Tuple    =				[(2, 1), (3, 1), (4, 3), (5, 2), (6, 1), (7, 2), (8, 6), (9, 8), (1_0, 8)]
					for u, v in edges:
										tree[u].append(v)
										tree[v].append(u)
					even_tree()
					print(len(cuts) - 1)




