N = gets.to_i
E = Hash.new { |h, k| h[k] = [] }

(N - 1).times do
  u, v = gets.split.map(&:to_i)
  E[u] << v
  E[v] << u
end

ans = 0

f =->(v, parent = -1) {
  cnt = E[v].size - 2
  ans += cnt if cnt > 0

  E[v].each do |u|
    next if u == parent

    f[u, v]
  end
}

root = [*0..N].index { |u| E[u].size == 1 }
queue = [[root, -1]]

until queue.empty?
  v, parent = queue.shift
  cnt = E[v].size - 2
  ans += cnt if cnt > 0

  E[v].each do |u|
    next if u == parent
    queue << [u, v]
  end
end

puts ans