#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int N = 2e5 + 5;
int n, u, v;
vector<int> e[N];
vector<vector<int> > dp(N, vector<int>(3, N));
void dfs(int v, int p) {
  for (auto a : e[v]) {
    if (a != p) dfs(a, v);
  }
  if (v == 1 || p == 1) {
    dp[v][0] = 0;
    for (auto a : e[v])
      if (a != p) dp[v][0] += min(dp[a][0], min(dp[a][1], dp[a][2]));
    return;
  }
  if (((int)(e[v]).size()) == 1) {
    dp[v][0] = 1;
    dp[v][1] = 1;
    dp[v][2] = 0;
    return;
  }
  dp[v][0] = 1;
  for (auto a : e[v])
    if (a != p) dp[v][0] += min(dp[a][0], min(dp[a][1], dp[a][2]));
  int sum = 0;
  for (auto a : e[v])
    if (a != p) sum += min(dp[a][0], dp[a][1]);
  for (auto a : e[v])
    if (a != p) {
      dp[v][1] = min(dp[v][1], sum - min(dp[a][0], dp[a][1]) + dp[a][0]);
    }
  dp[v][2] = 0;
  for (auto a : e[v])
    if (a != p) {
      dp[v][2] += min(dp[a][0], dp[a][1]);
    }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    cin >> u >> v;
    e[u].push_back(v);
    e[v].push_back(u);
  }
  dfs(1, 0);
  cout << min(dp[1][0], min(dp[1][1], dp[1][2])) << endl;
  return 0;
}
