#include <bits/stdc++.h>
using namespace std;
int n;
vector<vector<int> > vec(300100, vector<int>());
int parent[300100], state[300100], depth[300100];
priority_queue<pair<int, int> > q;
void buildTree(int node = 1, int par = -1) {
  parent[node] = par;
  depth[node] = depth[par] + 1;
  for (int i = 0; i < vec[node].size(); ++i) {
    int ngb = vec[node][i];
    if (ngb == par) continue;
    buildTree(ngb, node);
  }
}
void placeEdge(int node) {
  state[node] = 1;
  for (int i = 0; i < vec[node].size(); ++i) {
    int ngb = vec[node][i];
    state[ngb] = 1;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n;
  int temp1, temp2;
  for (int i = 0; i < n - 1; ++i) {
    cin >> temp1 >> temp2;
    vec[temp1].push_back(temp2);
    vec[temp2].push_back(temp1);
  }
  depth[1] = 1;
  buildTree();
  for (int i = 0; i < vec[1].size(); ++i) placeEdge(vec[1][i]);
  for (int i = 2; i <= n; ++i) {
    if (vec[i].size() == 1) q.push(pair<int, int>(depth[i], i));
  }
  int total = 0;
  while (!q.empty()) {
    int node = q.top().second;
    q.pop();
    if (state[node] == 1) continue;
    int placeNode = parent[node];
    placeEdge(placeNode);
    total++;
    if (state[parent[parent[placeNode]]] != 1) {
      int d = depth[parent[parent[placeNode]]];
      q.push(pair<int, int>(d, parent[parent[placeNode]]));
    }
  }
  cout << total << endl;
  return 0;
}
