#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
const long long int INF = 1e18;
const long long int N = 2e5 + 5;
vector<long long int> g[N];
long long int lvl[N], up[N];
set<pair<long long int, long long int>,
    greater<pair<long long int, long long int> > >
    remain;
void dfs(long long int u, long long int par) {
  lvl[u] = lvl[par] + 1;
  up[u] = par;
  for (auto& to : g[u]) {
    if (to != par) dfs(to, u);
  }
  if (lvl[u] > 2) remain.insert({lvl[u], u});
  return;
}
int32_t main() {
  long long int n;
  cin >> n;
  for (long long int i = 0; i < n - 1; i++) {
    long long int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  long long int ans = 0;
  lvl[0] = -1;
  dfs(1, 0);
  while (((long long int)(remain).size())) {
    auto it = remain.begin();
    long long int node = up[it->second];
    ans++;
    for (auto& to : g[node]) {
      if (remain.find({lvl[to], to}) != remain.end())
        remain.erase({lvl[to], to});
    }
    if (remain.find({lvl[node], node}) != remain.end())
      remain.erase({lvl[node], node});
  }
  cout << ans << " ";
  return 0;
}
