





'''simple docstring'''





from collections import defaultdict



def 	A_       (  _lowerCAmelCase  )		->				str:
 UpperCamelCase			:      str 			=     1
 UpperCamelCase			:      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_       (  )		->				Tuple:
 dfs(1  )


if __name__ == "__main__":
    __lowerCamelCase						,			__lowerCamelCase :  List[Any]										=  10, 9
    __lowerCamelCase :  str										=  defaultdict(list)
    __lowerCamelCase :  str										=  {}
    __lowerCamelCase :  List[str]										=  []
    __lowerCamelCase :  str										=  0
    __lowerCamelCase :  List[str]										=  [(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 math import loga



def 	A_       (  _lowerCAmelCase  )		->				int:
 if a < 0:
  raise ValueError("Input value must be a positive integer"  )
 elif isinstance(_lowerCAmelCase							,     _lowerCAmelCase  ):
  raise TypeError("Input value must be a 'int' type"  )
 return 0 if (a == 0) else int(loga(a & -a  )  )


if __name__ == "__main__":
    import doctest

    doctest.testmod()
