



from collections import defaultdict

def        __a			(   __lowerCAmelCase   )     ->     int:
					SCREAMING_SNAKE_CASE							:     List[Any]						=				1
					SCREAMING_SNAKE_CASE							:     Optional[int]						=				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			(   )     ->     Union[str, Any]:
					dfs(1   )


if __name__ == "__main__":
			_lowerCamelCase      ,						_lowerCamelCase    :		List[Any]		      =    10, 9
			_lowerCamelCase    :		Dict		      =    defaultdict(list)
			_lowerCamelCase    :		dict[int, bool]		      =    {}
			_lowerCamelCase    :		list[int]		      =    []
			_lowerCamelCase    :		Dict		      =    0
			_lowerCamelCase    :		List[Any]		      =    [(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)




from __future__ import annotations

import numpy as np

def        __a			(   __lowerCAmelCase   )     ->     Optional[Any]:
					return np.maximum(0      ,	__lowerCAmelCase   )


if __name__ == "__main__":
			print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]