#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <functional>

using namespace std;
typedef long long int ll;

#define repi(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,a) repi(i,0,a)
#define rrep(i,a) for(ll i=a-1;i>=0;i--)

ll count(ll start, vector<vector<ll>> edges, ll* visited){
  visited[start] = 1;
  bool stop = true;
  ll cnt = 0;
  for(auto it = edges[start].begin(); it != edges[start].end(); ++it){
    if(!visited[*it]){
      cnt += count(*it, edges, visited);
      if(!stop) cnt++;
      stop = false;
    }
  }
  return cnt;
}

int main(){
  ll N;
  cin >> N;
  vector<vector<ll> > edges(N);
  rep(i, N-1){
    ll a, b;
    scanf("%lld %lld", &a, &b);
    edges[a-1].push_back(b-1);
    edges[b-1].push_back(a-1);
  }
  ll visited[N] = {};

  ll start = 0;
  while(edges[start].size() != 1) start++;

  cout << count(start, edges, visited) << endl;
  return 0;
}