


'''simple docstring'''




from __future__ import annotations

from typing import Any





def 	a_					( lowerCamelCase	:     list				):
   if not postfix_notation:
      return 0

   lowerCAmelCase     =			{'+', '-', '*', '/'}
   lowerCAmelCase     =			[]

   for token in postfix_notation:
      if token in operations:
         lowerCAmelCase     ,  lowerCAmelCase     =			stack.pop(), stack.pop()
         if token == "+":
            stack.append(a + b				)
         elif token == "-":
            stack.append(a - b				)
         elif token == "*":
            stack.append(a * b				)
         else:
            if a * b < 0 and a % b != 0:
               stack.append(a // b + 1				)
            else:
               stack.append(a // b				)
      else:
         stack.append(int(lowerCamelCase				)				)

   return stack.pop()


if __name__ == "__main__":
       import doctest

       doctest.testmod()






from collections import defaultdict




def       _snake_case	(   lowerCAmelCase							:   int	):
		"""simple docstring"""







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




def       _snake_case	(   ):
		"""simple docstring"""







		dfs(1	)


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