import sys

# sys.setrecursionlimit(1000005)
# sys.set_int_max_str_digits(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-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

def rerooting(root=0):
    uu = []
    stack = [root]
    while stack:
        u = stack.pop()
        uu.append(u)
        vv = []
        # !!!check the format of the "to"!!!
        for v in to[u]:
            if v == par[u]: continue
            vv.append(v)
            par[v] = u
            stack.append(v)
        to[u] = vv

    # bottom up
    for u in uu[::-1]:
        p = par[u]
        if p == -1: continue
        dp[p] = merge(dp[p], trans_up(dp[u], u))

    # top down
    for u in uu:
        p = par[u]
        if p == -1: continue
        dp[u] = merge(dp[u], trans_down(purge(dp[p], trans_up(dp[u], u)), u))

# v is child
# a is parent's value
# b is child's value
def trans_up(b, v):
    b0,b1=b
    if b0>b1:b1=b0
    return [b0,b1]

def trans_down(a, v):
    b0,b1=a
    if b0>b1:b1=b0
    return [b0,b1]

def merge(a, b):
    aw,ab=a
    bw,bb=b
    return [aw+bb,ab+bw]

def purge(a, b):
    aw,ab=a
    bw,bb=b
    return [aw-bb,ab-bw]

n=II()
to=[[] for _ in range(n)]
for _ in range(n-1):
    u,v=LI1()
    to[u].append(v)
    to[v].append(u)

par = [-1]*n
dp = [[0,1] for _ in range(n)]
rerooting()
print(min(b for a,b in dp))