




def 				A__ (snake_case   :		int				)     ->						int:
					__UpperCamelCase					:	List[Any]             =      0
					while num > 0:
										digit_sum += num % 10
										num //= 10
					return digit_sum





def 				A__ (snake_case   :		int = 1_00				)     ->						int:
					__UpperCamelCase					:	Dict             =      1
					__UpperCamelCase					:	List[str]             =      2

					for i in range(2		,	max_n + 1				):
										__UpperCamelCase					:	Dict             =      pre_numerator
										__UpperCamelCase					:	Optional[int]             =      2 * i // 3 if i % 3 == 0 else 1
										__UpperCamelCase					:	str             =      cur_numerator
										__UpperCamelCase					:	List[str]             =      e_cont * pre_numerator + temp

					return sum_digits(snake_case				)


if __name__ == "__main__":
	print(f"{solution() = }")












from collections import defaultdict





def 				A__ (snake_case   :		int				)     ->						int:
					__UpperCamelCase					:	Optional[int]             =      1
					__UpperCamelCase					:	Tuple             =      True
					for v in tree[start]:
										if v not in visited:
															ret += dfs(snake_case				)
					if ret % 2 == 0:
										cuts.append(snake_case				)
					return ret





def 				A__ ()     ->						str:
					dfs(1				)


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






