





"""simple docstring"""
from collections import defaultdict



def 					__lowerCamelCase       (							a_					:		int							)      ->				int:
      __SCREAMING_SNAKE_CASE       :Union[str, Any]		    =  1
      __SCREAMING_SNAKE_CASE       :Dict		    =  True
      for v in tree[start]:
            if v not in visited:
                  ret += dfs(a_							)
      if ret % 2 == 0:
            cuts.append(a_							)
      return ret



def 					__lowerCamelCase       (							)      ->				Union[str, Any]:
      dfs(1							)


if __name__ == "__main__":
  lowerCamelCase_      ,					lowerCamelCase_       =		1_0, 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), (1_0, 8)]
  for u, v in edges:
    tree[u].append(v)
    tree[v].append(u)
  even_tree()
  print(len(cuts) - 1)






"""simple docstring"""
from __future__ import annotations

import math



def 					__lowerCamelCase       (							a_					:		int			,       a_					:		int			,       a_					:		bool			,       a_					:		list[int]			,       a_					:		float							)      ->				int:

      if depth < 0:
            raise ValueError('''Depth cannot be less than 0'''							)

      if len(a_							) == 0:
            raise ValueError('''Scores cannot be empty'''							)

      if depth == height:
            return scores[node_index]

      if is_max:
            return max(
                minimax(depth + 1			,       node_index * 2			,       a_			,       a_			,       a_							)			,       minimax(depth + 1			,       node_index * 2 + 1			,       a_			,       a_			,       a_							)			,       )

      return min(
          minimax(depth + 1			,       node_index * 2			,       a_			,       a_			,       a_							)			,       minimax(depth + 1			,       node_index * 2 + 1			,       a_			,       a_			,       a_							)			,       )



def 					__lowerCamelCase       (							)      ->				None:
      __SCREAMING_SNAKE_CASE       :Dict		    =  [90, 23, 6, 33, 21, 65, 1_23, 3_44_23]
      __SCREAMING_SNAKE_CASE       :Optional[int]		    =  math.log(len(a_							)			,       2							)
      print('''Optimal value : '''			,       end=''''''							)
      print(minimax(0			,       0			,       a_			,       a_			,       a_							)							)


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  main()