
from collections import defaultdict


def 							__A(lowerCAmelCase )		->				int:

		"""simple docstring"""






		_UpperCamelCase						    =	1
		_UpperCamelCase						    =	True
		for v in tree[start]:
				if v not in visited:
						ret += dfs(lowerCAmelCase )
		if ret % 2 == 0:
				cuts.append(lowerCAmelCase )
		return ret


def 							__A()		->				Dict:

		"""simple docstring"""






		dfs(1 )


if __name__ == "__main__":
				lowerCamelCase__,	lowerCamelCase__	=							10, 9
				lowerCamelCase__	=							defaultdict(list)
				lowerCamelCase__	=							{}
				lowerCamelCase__	=							[]
				lowerCamelCase__	=							0
				lowerCamelCase__	=							[(2, 1), (3, 1), (4, 3), (5, 2), (6, 1), (7, 2), (8, 6), (9, 8), (10, 8)]
				for u, v in edges:
								tree[u].append(v)
								tree[v].append(u)
				even_tree()
				print(len(cuts) - 1)





lowerCamelCase__	=							[
    "DownloadConfig",
    "DownloadManager",
    "DownloadMode",
    "StreamingDownloadManager",
]

from .download_config import DownloadConfig
from .download_manager import DownloadManager, DownloadMode
from .streaming_download_manager import StreamingDownloadManager



