#include <bits/stdc++.h>
using namespace std;
double const EPS = 1e-12, PI = acos(-1);
const int N = 6e5 + 9, M = 5e3 + 9, OO = 1e9 + 7, MOD = 1e9 + 7;
const long long inf = 1e18 + 9;
vector<int> adj[N];
int dist[N];
int vis[N];
vector<pair<int, pair<int, int>>> vv;
void bfs() {
  queue<int> q;
  q.push(1);
  memset(dist, -1, sizeof dist);
  dist[1] = 1;
  while (!q.empty()) {
    auto tp = q.front();
    q.pop();
    for (auto it : adj[tp]) {
      if (dist[it] != -1) continue;
      dist[it] = dist[tp] + 1;
      q.push(it);
      vv.push_back({-dist[it], {it, tp}});
    }
  }
}
int main() {
  cout << fixed << setprecision(12), ios::sync_with_stdio(false),
      cin.tie(nullptr), cout.tie(nullptr);
  int n, u, v;
  cin >> n;
  for (int i = 1; i < n; ++i) {
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  bfs();
  vis[1] = 1;
  for (auto it : adj[1]) vis[it] = 1;
  sort(((vv).begin()), ((vv).end()));
  int cnt = 0;
  for (int i = 0; i < (int)vv.size(); ++i) {
    if (vis[vv[i].second.first] >= 1 || vis[vv[i].second.second] == 1) continue;
    vis[vv[i].second.second] = 1;
    for (auto it : adj[vv[i].second.second]) {
      if (vis[it]) continue;
      vis[it] = 2;
    }
    ++cnt;
  }
  cout << cnt;
  return 0;
}
