from collections import defaultdict,deque
N=int(input())
E=defaultdict(list)
for i in range(N-1):
  a,b=map(int,input().split())
  E[a].append(b)
d=deque()
d.append(1)  
num=0
visited=[]
def dfs(d,num,visited):
  if len(d)==0:
    return num
  x=d.pop()
  visited.append(x)
  if len(E[x])==0:
    num+=1
    return dfs(d,num,visited)
  for v in E[x]:
    if v not in visited:
      d.append(v)
  return dfs(d,num,visited)
ans=dfs(d,num,visited)-2
if ans>=0:
  print(ans)
else:
  print(0)