'''simple docstring'''

from collections import defaultdict

def 							UpperCamelCase__			(			a__      ):


						'''simple docstring'''






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

def 							UpperCamelCase__			(			):


						'''simple docstring'''






						dfs(1      )


if __name__ == "__main__":
							lowercase_		,			lowercase_     		= 10, 9
							lowercase_     		= defaultdict(list)
							lowercase_     		= {}
							lowercase_     		= []
							lowercase_     		= 0
							lowercase_     		= [(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)






'''simple docstring'''

from __future__ import annotations



def 							UpperCamelCase__			(			a__      ):


						'''simple docstring'''






						_lowerCAmelCase										=len(a__      ) // 2

						# choose the middle 3 elements
						_lowerCAmelCase										=lst[m - 1 : m + 2]

						# if middle element is peak
						if three[1] > three[0] and three[1] > three[2]:
												return three[1]

						# if increasing, recurse on right
						elif three[0] < three[2]:
												if len(lst[:m]      ) == 2:
																		m -= 1
												return peak(lst[m:]      )

						# decreasing
						else:
												if len(lst[:m]      ) == 2:
																		m += 1
												return peak(lst[:m]      )


if __name__ == "__main__":
							import doctest

							doctest.testmod()





