N = int(input())
tree = [[] for _ in range(N+1)] 
for _ in range(N-1):
  a,b = map(int,input().split())
  tree[a].append(b)
  tree[b].append(a)
ans = 0

for i in range(N+1):
  if len(tree[i]) > 2:
    ans += len(tree[i])-2

print(ans)