import sys
sys.setrecursionlimit(10000000)
N = int(input())
e = [ [] for i in range(N)]
for i in range(N-1):
    a,b = map(int,input().split())
    a-=1
    b-=1
    e[a].append(b)
    e[b].append(a)

#最も次数の小さい頂点から深さ優先探索。葉の枚数－１が答え

col = [ False for i in range(N)]
ans = 0
def dfs(n,pre):
    global ans

    if pre != -1 and len(e[n]) == 1 and e[n][0] == pre:
        ans += 1

    col[n] = True
    for node in e[n]:
        if col[node] == False:
            dfs(node,n)

k = -1
m = 10**10
for i in range(N):
    if len(e[i]) < m:
        k = i
        m = len(e[i])

dfs(k,-1)
print(ans-1)