import sys sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = (1 << 63)-1 # inf = (1 << 31)-1 # md = 10**9+7 md = 998244353 from heapq import * n = II() to = [[] for _ in range(n)] for _ in range(n-1): u, v = LI1() to[u].append(v) to[v].append(u) size = [1]*n hps = [[] for _ in range(n)] def merge(u, v): swap = False if len(hps[u]) < len(hps[v]): u, v = v, u swap = True for s in hps[v]: heappush(hps[u], s) if swap: hps[v] = hps[u] def dfs(u=0, par=-1): # ss = [] for v in to[u]: if v == par: continue dfs(v, u) merge(u, v) hps[u].append(-size[v]) if hps[u]: size[u] -= heappop(hps[u]) if hps[u]: size[u] -= heappop(hps[u]) # print(u, par, size, hps) dfs() print(size[0])