#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 10, mod = 1e9 + 7;
long long an1 = 0, an2 = 0;
vector<long long> g[N], pa(N, 0), dep(N, 0);
long long dfs(long long u, long long p, long long d) {
  pa[u] = p;
  dep[u] = d;
  long long h = 0;
  for (long long i : g[u]) {
    if (i != p) {
      h = max(h, 1 + dfs(i, u, d + 1));
    }
  }
  return h;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n;
  cin >> n;
  for (long long i = 0; i < n - 1; i++) {
    long long u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(1, 1, 0);
  set<pair<long long, long long>> mp;
  for (long long i = 0; i < n + 1; i++) {
    if (dep[i] > 2) {
      mp.insert(make_pair(-dep[i], i));
    }
  }
  long long an = 0;
  while (!mp.empty()) {
    long long cr = mp.begin()->second;
    ++an;
    cr = pa[cr];
    auto it = mp.find(make_pair(-dep[cr], cr));
    if (it != mp.end()) mp.erase(it);
    for (auto j : g[cr]) {
      auto ix = mp.find(make_pair(-dep[j], j));
      if (ix != mp.end()) mp.erase(ix);
    }
  }
  cout << an;
}
