n=int(input())
graph=[]
for i in range(n):
  graph.append([])
for i in range(n-1):
  a,b=map(int,input().split())
  graph[a-1].append(b-1)
  graph[b-1].append(a-1)
count0=0
count1=0
stack=[(0,0)]
visited=[0]*n
while stack:
  v,co=stack.pop()
  if co==0:
    count0+=1
  else:
    count1+=1
  visited[v]=1
  for i in graph[v]:
    if not visited[i]:
      stack.append((i,1-co))
print(min(count0,count1))