#include <bits/stdc++.h>
using namespace std;
inline int read() {
  char x = getchar();
  int lin = 0, f = 1;
  while (x < '0' || x > '9') {
    if (x == '-') f = -1;
    x = getchar();
  }
  while (x >= '0' && x <= '9') {
    lin = (lin << 1) + (lin << 3) + x - '0';
    x = getchar();
  }
  return lin * f;
}
int n, head[500005], u, v, tot, f[500005], dep[500005], us[500005], ans;
struct st {
  int v, nex;
} s[500005];
priority_queue<pair<int, int> > q;
void add(int u, int v) {
  s[++tot] = (st){v, head[u]};
  head[u] = tot;
}
void dfs(int now, int fa) {
  f[now] = fa;
  for (int i = head[now]; i; i = s[i].nex)
    if (s[i].v != fa) {
      dep[s[i].v] = dep[now] + 1;
      dfs(s[i].v, now);
    }
  q.push(make_pair(dep[now], now));
}
signed main() {
  n = read();
  for (int i = 1; i < n; i++) {
    u = read();
    v = read();
    add(u, v);
    add(v, u);
  }
  dfs(1, 1);
  while (q.size()) {
    int now = q.top().second;
    q.pop();
    if (us[now]) continue;
    if (dep[now] <= 2) continue;
    now = f[now];
    us[now] = 1;
    for (int i = head[now]; i; i = s[i].nex) us[s[i].v] = 1;
    ++ans;
  }
  cout << ans;
}
