n = int(input())
node = [[] for _ in range(n)]
A = [-1] * n
B = [0] * n
C = [0] * n
for _ in range(n-1):
    u, v = list(map(lambda x: int(x)-1, input().split()))
    node[u].append(v)
    node[v].append(u)
    B[u] += 1
    B[v] += 1

S = [i for i in range(n) if B[i] == 1]
ans = 0
while S:
    now = S.pop()
    #print(now)
    if A[now] == -1 and C[now] * 2 > len(node[now]):
        A[now] = 1
    for nxt in node[now]:
        if B[nxt]:
            B[now] -= 1
            B[nxt] -= 1
            if A[now] == -1:
                if A[nxt] == -1:
                    #print(now, nxt)
                    ans += 1
                    A[nxt] = 1
            else:
                C[nxt] += 1
            if not B[nxt] - 1:
                S.append(nxt)
    if A[now] == -1: A[now] = 0
print(ans)