#include <bits/stdc++.h>
using namespace std;
int n;
int otm[200001];
int t[200001];
int answer;
vector<int> v[200001];
void otmet(int x) {
  answer++;
  otm[x] = 1;
  for (int i = 0; i < v[x].size(); i++) {
    otm[v[x][i]] = 1;
  }
}
int main() {
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    int x, y;
    cin >> x >> y;
    v[y - 1].push_back(x - 1);
    v[x - 1].push_back(y - 1);
  }
  queue<int> q;
  q.push(0);
  t[0] = 0;
  otm[0] = 1;
  int time0 = -1;
  vector<pair<int, int> > para;
  while (!q.empty()) {
    time0++;
    int s = q.size();
    for (int i = 0; i < s; i++) {
      int tec = q.front();
      para.push_back({time0, tec});
      t[tec] = time0;
      for (int j = 0; j < v[tec].size(); j++) {
        if (otm[v[tec][j]] == 0) {
          otm[v[tec][j]] = 1;
          q.push(v[tec][j]);
        }
      }
      q.pop();
    }
  }
  sort(para.rbegin(), para.rend());
  for (int i = 0; i <= 200000; i++) {
    otm[i] = 0;
  }
  int i = 0;
  while (para[i].first > 2) {
    int l = i;
    while (para[i + 1].first == para[i].first) {
      i++;
    }
    int r = i;
    for (int j = l; j <= r; j++) {
      if (!otm[para[j].second]) {
        for (int p = 0; p < v[para[j].second].size(); p++) {
          if ((!otm[v[para[j].second][p]]) ||
              (t[v[para[j].second][p]] < t[para[j].second])) {
            otmet(v[para[j].second][p]);
          }
        }
      }
      if (!otm[para[j].second]) {
        otmet(para[j].second);
      }
    }
    i++;
  }
  cout << answer;
  return 0;
}
