#include <bits/stdc++.h>
using namespace std;
long long int sqr(long long int x) { return x * x; }
inline long long int add(long long int a, long long int b) {
  long long int c = a + b;
  if (c >= 1000000007) c -= 1000000007;
  return c;
}
inline long long int mul(long long int a, long long int b) {
  return (a * 1ll * b) % 1000000007;
}
inline long long int sub(long long int a, long long int b) {
  long long int c = a - b;
  if (c < 0) c += 1000000007;
  return c;
}
const long long int nax = 200 * 1000 + 10;
long long int n;
vector<long long int> G[nax];
vector<long long int> dis(nax, 0), par(nax, -1);
long long int ans = 0;
void dfs(long long int st, long long int d = 0, long long int p = -1) {
  dis[st] = d;
  par[st] = p;
  for (long long int to : G[st]) {
    if (to != p) {
      dfs(to, d + 1, st);
    }
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  for (long long int i = 1; i < n; ++i) {
    long long int a, b;
    cin >> a >> b;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  dfs(1);
  set<pair<long long int, long long int>> s;
  for (long long int i = 1; i <= n; ++i) {
    if (dis[i] > 2) {
      s.insert({-dis[i], i});
    }
  }
  while (!s.empty()) {
    long long int v = s.begin()->second;
    ;
    v = par[v];
    ++ans;
    auto it = s.find({-dis[v], v});
    if (it != s.end()) {
      s.erase(it);
    }
    for (long long int to : G[v]) {
      auto it = s.find({-dis[to], to});
      if (it != s.end()) {
        s.erase(it);
      }
    }
  }
  cout << ans;
  return 0;
}
