n=int(input())
X=[None]
for i in range(n):
    X.append([])
C=[None]+[0]*n
for i in range(n-1):
    a,b=map(int,input().split())
    C[a]+=1
    C[b]+=1
    X[a].append(b)
    X[b].append(a)
for i in range(1,n+1):
    C[i]=C[i]//2+1
P=[None]+[-1]*n
D=[[1]]
past={1}
while True:
    I=[]
    for i in D[-1]:
        for j in X[i]:
            if not j in past:
                I.append(j)
                P[j]=i
                past.add(j)
    if I==[]:
        break
    D.append(I)
ans=n
while len(D)>1:
    I=D.pop()
    for i in I:
        if C[i]<=1:
            ans-=1
        if C[i]!=1:
            C[P[i]]-=1
if C[1]<=1:
    ans-=1
print(ans)