#include <bits/stdc++.h>
using namespace std;
const int N = 2e5;
const int oo = 1e9 + 5;
int du[] = {-1, 0, 0, 1};
int dv[] = {0, -1, 1, 0};
const long long mod = 1e9 + 7;
long long sqr(long long x) { return x * x; }
int n, f[N + 5][4], dad[N + 5];
vector<int> a[N + 5];
void dfs(int u, int p) {
  dad[u] = p;
  if (u == 1) {
    for (auto v : a[u])
      if (v != p) {
        dfs(v, u);
        f[u][1] += f[v][1];
      }
    return;
  }
  f[u][1] = f[u][3] = 0;
  f[u][2] = oo;
  for (auto v : a[u])
    if (v != p) {
      dfs(v, u);
      f[u][1] += min(f[v][3], min(f[v][1], f[v][2]));
      f[u][3] += min(f[v][1], f[v][2]);
    }
  for (auto v : a[u])
    if (v != p)
      f[u][2] = min(f[u][2], f[u][3] - min(f[v][1], f[v][2]) + f[v][1]);
  f[u][1] += (dad[u] != 1);
  if (dad[u] == 1) f[u][2] = f[u][3] = oo;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n;
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    a[u].push_back(v);
    a[v].push_back(u);
  }
  dfs(1, 0);
  cout << f[1][1];
  return 0;
}
