#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 5;
int mian() {
  int s = 0, f = 1;
  char ch;
  while (!isdigit(ch = getchar())) (ch == '-') && (f = -1);
  for (s = ch - '0'; isdigit(ch = getchar()); s = s * 10 + ch - '0')
    ;
  return s * f;
}
struct ED {
  int to;
  ED *nt;
};
ED *head[maxn];
void add(int x, int y) {
  static ED s[maxn], *tail = s;
  tail->to = y;
  tail->nt = head[x];
  head[x] = tail++;
}
int n, m;
int f[maxn], g[maxn], h[maxn], vis[maxn];
void dfs(int x, int fa) {
  if (!vis[x]) g[x] = 1;
  for (ED *i = head[x]; i; i = i->nt) {
    if (i->to != fa) {
      dfs(i->to, x);
      f[x] += min(g[i->to], h[i->to]);
      g[x] += min(g[i->to], f[i->to]);
    }
  }
  int mi = 0x7fffffff;
  for (ED *i = head[x]; i; i = i->nt)
    if (i->to != fa) mi = min(mi, f[x] - min(g[i->to], h[i->to]) + g[i->to]);
  h[x] += mi;
}
int main() {
  n = mian();
  for (int i = 1; i < n; ++i) {
    int x = mian(), y = mian();
    add(x, y), add(y, x);
  }
  vis[1] = 1;
  for (ED *i = head[1]; i; i = i->nt) vis[i->to] = 1;
  dfs(1, 0);
  cout << g[1] << endl;
  return 0;
}
