#include <bits/stdc++.h>
using namespace std;
vector<int> vect[200100];
set<pair<int, int> > st;
set<pair<int, int> >::iterator it;
queue<int> que;
int level[200100], u, p, cnt, a, z, c, v, m, n, parent[200100];
void bfs() {
  int i;
  level[1] = 0;
  que.push(1);
  while (!que.empty()) {
    u = que.front();
    for (i = 0; i < vect[u].size(); i++) {
      p = vect[u][i];
      if (level[p] == 0) {
        parent[p] = u;
        level[p] = level[u] + 1;
        que.push(p);
        if (level[p] > 2) {
          st.insert(make_pair(-level[p], p));
        }
      }
    }
    que.pop();
  }
  while (!st.empty()) {
    it = st.begin();
    cnt++;
    a = (*it).second;
    z = parent[a];
    for (i = 0; i < vect[z].size(); i++) {
      c = vect[z][i];
      it = st.find(make_pair(-level[c], c));
      if (it != st.end()) st.erase(it);
    }
    it = st.find(make_pair(-level[z], z));
    if (it != st.end()) st.erase(it);
  }
}
int main() {
  cin >> v;
  for (int i = 0; i < v - 1; i++) {
    cin >> m >> n;
    vect[m].push_back(n);
    vect[n].push_back(m);
  }
  bfs();
  cout << cnt << endl;
}
