#include <bits/stdc++.h>
using namespace std;
const long long N = 200005, INF = 2000000000000000000;
long double pi = 3.1415926535897932;
long long power(long long a, long long b, long long p) {
  if (a == 0) return 0;
  long long res = 1;
  a %= p;
  while (b > 0) {
    if (b & 1) res = (res * a) % p;
    b >>= 1;
    a = (a * a) % p;
  }
  return res;
}
vector<long long> v[N];
bool visit[N];
long long dp[N][3];
void dfs(long long u, long long d) {
  visit[u] = true;
  long long a1 = 0, a2 = 0, a3 = 0, f = 0, ch = INF;
  for (auto to : v[u]) {
    if (!visit[to]) {
      dfs(to, d + 1);
      a1 += min({dp[to][0], dp[to][1], dp[to][2]});
      a2 += dp[to][0];
      a3 += min(dp[to][0], dp[to][1]);
      ch = min(ch, dp[to][0] - min(dp[to][0], dp[to][1]));
      f = 1;
    }
  }
  if (d != 1)
    dp[u][0] = a1 + 1;
  else
    dp[u][0] = a1;
  if (f == 1 || d <= 2)
    dp[u][1] = min(a3 + ch, a2);
  else
    dp[u][1] = 1;
  dp[u][2] = a3;
  return;
}
int32_t main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout.precision(std::numeric_limits<double>::max_digits10);
  ;
  memset(visit, false, sizeof(visit));
  long long n;
  cin >> n;
  for (long long i = 0; i < n - 1; i++) {
    long long a, b;
    cin >> a >> b;
    v[a].push_back(b);
    v[b].push_back(a);
  }
  dfs(1, 0);
  cout << dp[1][0] - 1;
}
