#!/usr/bin/python3

# 非再帰全方位木DP
# https://qiita.com/Kiri8128/items/a011c90d25911bdb3ed3 を改変
import sys
input = sys.stdin.readline
from collections import deque

# input
N = int(input())
X = [[] for i in range(N)]
for i in range(N-1):
    x, y = map(int, input().split())
    X[x-1].append(y-1)
    X[y-1].append(x-1)

# topological sort
P = [-1] * N
Q = deque([0])
R = []
while Q:
    i = deque.popleft(Q)
    R.append(i)
    for a in X[i]:
        if a != P[i]:
            P[a] = i
            X[a].remove(i)
            deque.append(Q, a)

# dp
dp = [(0, 1)] * N

for i in R[::-1]:
    for j in X[i]:
        dp[i] = (dp[i][0] + max(dp[j]), dp[i][1] + dp[j][0])

for i in R:
    for j in X[i]:
        dp_par = (dp[i][0] - max(dp[j][0], dp[j][1]), dp[i][1] - dp[j][0])
        dp[j] = (dp[j][0] + max(dp_par), dp[j][1] + dp_par[0])

print(min([a[1] for a in dp]))