#include <bits/stdc++.h>
const int INFI = (1 << 29);
const long long INFL = (1LL << 62);
using namespace std;
long long nodos, desde, hasta, r = 0;
vector<vector<long long> > adj;
vector<long long> d, p;
void DFS(long long nodo, long long padre, long long dist) {
  d[nodo] = dist;
  p[nodo] = padre;
  for (long long i : adj[nodo])
    if (i != padre) DFS(i, nodo, (dist + 1));
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> nodos;
  adj.resize(nodos + 1);
  d = p = vector<long long>((nodos + 1), 0);
  for (long long i = 0; i < (nodos - 1); i++) {
    cin >> desde >> hasta;
    adj[desde].push_back(hasta);
    adj[hasta].push_back(desde);
  }
  DFS(1, (-1), 0);
  set<pair<long long, long long> > mSet;
  for (long long i = 1; i <= nodos; i++)
    if (d[i] > 2) mSet.insert({-d[i], i});
  while (int(mSet.size())) {
    long long nodo = mSet.begin()->second;
    nodo = p[nodo];
    if (mSet.find({-d[nodo], nodo}) != mSet.end()) mSet.erase({-d[nodo], nodo});
    r++;
    for (long long i : adj[nodo])
      if (mSet.find({-d[i], i}) != mSet.end())
        mSet.erase(mSet.find({-d[i], i}));
  }
  cout << r << "\n";
  return 0;
}
