import sys
input=sys.stdin.buffer.readline
sys.setrecursionlimit(10**6)
N=int(input())
G=[[] for i in range(N)]
for i in range(N-1):
  u,v=map(int,input().split())
  u-=1
  v-=1
  G[u].append(v)
  G[v].append(u)
DP=[[N,N] for i in range(N)]
def dfs(n,p):
  DP[n]=[0,0]
  for i in range(len(G[n])):
    if G[n][i]!=p:
      dfs(G[n][i],n)
      DP[n][0]+=min(DP[G[n][i]])
      DP[n][1]+=DP[G[n][i]][0]
  DP[n][0]+=1

dfs(0,-1)
print(min(DP[0]))