#include <bits/stdc++.h>
using namespace std;
const int maxn = 200000;
vector<int> G[maxn + 5];
int par[maxn + 5];
int d[maxn + 5];
void dfs(int u, int p, int dis) {
  par[u] = p;
  d[u] = dis;
  for (int i = 0; i < G[u].size(); i++) {
    int w = G[u][i];
    if (w == p) continue;
    dfs(w, u, dis + 1);
  }
  return;
}
int main() {
  int n;
  cin >> n;
  int u, v;
  for (int i = 0; i < n - 1; i++) {
    scanf("%d%d", &u, &v);
    G[u].push_back(v);
    G[v].push_back(u);
  }
  dfs(1, 0, 0);
  set<pair<int, int> > st;
  for (int i = 1; i <= n; i++) {
    if (d[i] > 2) {
      st.insert(make_pair(-d[i], i));
    }
  }
  int res = 0;
  while (!st.empty()) {
    int v = st.begin()->second;
    v = par[v];
    res++;
    set<pair<int, int> >::iterator it = st.find(make_pair(-d[v], v));
    if (it != st.end()) {
      st.erase(it);
    }
    for (int i = 0; i < G[v].size(); i++) {
      int w = G[v][i];
      pair<int, int> gg = make_pair(-d[w], w);
      it = st.find(gg);
      if (it != st.end()) st.erase(it);
    }
  }
  printf("%d\n", res);
  return 0;
}
