#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
struct node {
  int u, dep;
};
bool operator<(const node &x, const node &y) { return x.dep < y.dep; }
int n;
int dep[N];
bool used[N] = {0};
int hed[N], tal[N << 2], nxt[N << 2], cnt = 0, f[N];
priority_queue<node> Q;
int ans = 0;
void addege(int x, int y) {
  cnt++;
  tal[cnt] = y;
  nxt[cnt] = hed[x];
  hed[x] = cnt;
}
void dfs(int u, int fa) {
  f[u] = fa;
  for (int i = hed[u]; i; i = nxt[i]) {
    int v = tal[i];
    if (v == fa) continue;
    dep[v] = dep[u] + 1;
    dfs(v, u);
  }
}
void push(int u, int dp) {
  node aa;
  aa.dep = dp, aa.u = u;
  Q.push(aa);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    addege(x, y), addege(y, x);
  }
  dep[1] = 0;
  dfs(1, 1);
  for (int i = 1; i <= n; i++)
    if (dep[i] > 2) push(i, dep[i]);
  while (!Q.empty()) {
    node u = Q.top();
    Q.pop();
    if (used[u.u]) continue;
    int p = f[u.u];
    used[p] = 1;
    ans++;
    for (register int i = hed[p]; i; i = nxt[i]) {
      int v = tal[i];
      used[v] = 1;
    }
  }
  cout << ans;
  return 0;
}
