# 頂点削除、以下の方法でどうか
# 次数管理して、まず次数3以上の頂点を次数降順で消していく
# 1つの頂点を消すと辺のある先の次数も変わる
# すべての次数が2以下になれば、すべての連結成分は道になる
# 道の頂点数をkとすれば(k+1)//2の独立頂点ができる

N = int(input())
edges = [[] for i in range(N+1)]
degree = [0]*(N+1)
for i in range(N-1):
    u, v = map(int, input().split())
    edges[u].append(v)
    edges[v].append(u)
    degree[u] += 1
    degree[v] += 1
    
degree_max = max(degree)
removed = 0

for d in range(degree_max, 2, -1):
    for i in range(1, N+1):
        if degree[i] == d:
            removed += 1
            temp = []
            for nxt in edges[i]:
                temp.append(nxt)
            for nxt in temp:
                #print('d', d, 'i', i, 'nxt', nxt)
                degree[nxt] -= 1
                degree[i] -= 1
                edges[i].remove(nxt)
                edges[nxt].remove(i)
    #print(d, degree)
    #print(edges)

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())

UF = UnionFind(N+1)
for i in range(1, N+1):
    for nxt in edges[i]:
        if UF.same(i, nxt) == False:
            UF.unite(i, nxt)
    
ans = -removed
for r in UF.roots():
    if r == 0:
        continue
    ans += (UF.size(r)+1)//2
print(ans)