#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
template <typename T, typename U>
static void amin(T &x, U y) {
  if (y < x) x = y;
}
template <typename T, typename U>
static void amax(T &x, U y) {
  if (x < y) x = y;
}
template <typename T>
void sout(T &w) {
  for (auto x : w) cout << x << ", ";
  cout << endl;
}
int i, j, n;
vector<vector<int> > chs;
vector<int> dfs(int rt, int pa, int depth) {
  vector<int> a(4);
  if (depth > 1) a[0] = 1;
  int min_diff = 1e9;
  int sum2 = 0;
  int sum_min = 0;
  for (int c : chs[rt])
    if (c != pa) {
      vector<int> d = dfs(c, rt, depth + 1);
      a[0] += min(d[0], min(d[1], d[2]));
      a[1] += min(d[0], d[2]);
      sum2 += d[2];
      sum_min += min(d[0], d[2]);
      amin(min_diff, d[0] - d[2]);
    }
  if (sum_min == sum2) sum_min += min_diff;
  a[2] = sum_min;
  return a;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n;
  chs = vector<vector<int> >(n, vector<int>());
  for (int i = 0; i < (int)(n - 1); ++i) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    chs[u].push_back(v);
    chs[v].push_back(u);
  }
  cout << dfs(0, -1, 0)[0] << endl;
}
