#include <bits/stdc++.h>
using namespace std;
const int NMAX = 2e5 + 5;
unsigned int dis[NMAX], father[NMAX];
char checked[NMAX];
vector<int> v[NMAX];
struct pairri {
  unsigned int dis, index;
  pairri(unsigned int r = 0, unsigned int i = 0) : dis(r), index(i){};
  bool operator<(const pairri &p) const { return dis < p.dis; }
};
priority_queue<pairri> pq;
queue<pairri> que;
int main() {
  cout.sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  {
    memset(dis, -1, NMAX * sizeof(unsigned int));
    memset(checked, 0, NMAX * sizeof(char));
    int x, y;
    dis[0] = dis[1] = 0;
    for (int i = 2; i <= n; i++) {
      cin >> x >> y;
      v[x].push_back(y);
      v[y].push_back(x);
    }
    que.push(pairri(0, 1));
    father[1] = 1;
    while (que.size()) {
      unsigned int index = que.front().index, vdis = que.front().dis;
      que.pop();
      if (!checked[index]) {
        dis[index] = vdis;
        checked[index] = 1;
        int vsize = v[index].size();
        for (int i = 0; i < vsize; i++) {
          unsigned int vindex = v[index][i];
          if (!checked[vindex]) {
            father[vindex] = index;
            que.push(pairri(vdis + 1, vindex));
          }
        }
      }
    }
    for (int i = 1; i <= n; i++)
      if (dis[i] > 2) pq.push(pairri(dis[i], i));
  }
  int ans = 0;
  while (!pq.empty()) {
    int pindex = pq.top().index;
    pq.pop();
    if (dis[pindex] > 2) {
      dis[pindex] = 2;
      ans++;
      int fa = father[pindex], imax = v[fa].size();
      dis[fa] = 1;
      for (int i = 0; i < imax; i++) dis[v[fa][i]] = 2;
    }
  }
  cout << ans << endl;
  return 0;
}
