#include <bits/stdc++.h>
using namespace std;
int const N = 2e5 + 2;
int n;
int ans = 0;
vector<int> D[N];
int ancest[N];
int dist[N];
set<pair<int, int>> pompom;
void dfs(int a, int pre) {
  for (int i = 0; i < D[a].size(); i++) {
    int u = D[a][i];
    if (u == pre) continue;
    ancest[u] = a;
    dist[u] = dist[a] + 1;
    if (dist[u] > 2) pompom.insert({dist[u], u});
    dfs(u, a);
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int a, b;
    scanf("%d %d", &a, &b);
    D[a].push_back(b);
    D[b].push_back(a);
  }
  dist[1] = 0;
  dfs(1, 0);
  while (pompom.empty() == false) {
    auto it = pompom.end();
    it--;
    int kl = (*it).second;
    int u = ancest[kl];
    if (dist[u] > 2) pompom.erase({dist[u], u});
    for (int i = 0; i < D[u].size(); i++) {
      int ww = D[u][i];
      pompom.erase({dist[ww], ww});
    }
    ans++;
  }
  printf("%d", ans);
  return 0;
}
