#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int limit = 1e6 + 10;
vector<long long int> prime[limit + 1];
const long long int M = 1e9 + 7;
long long int power(long long int a, long long int n) {
  if (n == 0)
    return 1;
  else if (n == 1)
    return n;
  long long int z = power(a, n / 2);
  if (n & 1)
    return ((z % M * z % M) % M * a % M) % M;
  else
    return (z % M * z % M) % M;
}
bool sortbysecdesc(const pair<int, int> &a, const pair<int, int> &b) {
  return a.second > b.second;
}
void print1(vector<long long int> a) {
  for (int i : a) {
    cout << i << " ";
  }
  cout << endl;
  return;
}
const int N = 2e5 + 10;
vector<long long int> g[N];
vector<bool> vis(N);
vector<long long int> dist(N), p(N);
void dfs(long long int x, long long int dis = 0, long long int par = -1) {
  p[x] = par;
  vis[x] = true;
  dist[x] = dis;
  for (auto it : g[x]) {
    if (!vis[it]) dfs(it, dis + 1, x);
  }
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  long long int n;
  cin >> n;
  long long int i;
  for (i = 1; i < n; i++) {
    long long int x, y;
    cin >> x >> y;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  dfs(1);
  set<pair<long long int, long long int> > a;
  for (i = 1; i <= n; i++) {
    if (dist[i] > 2) {
      a.insert(make_pair(-dist[i], i));
    }
  }
  long long int ans = 0;
  while (!a.empty()) {
    long long int x = a.begin()->second;
    long long int px = p[x];
    ans++;
    auto to = make_pair(-dist[px], px);
    if (a.find(to) != a.end()) {
      a.erase(to);
    }
    for (auto it : g[px]) {
      to = make_pair(-dist[it], it);
      if (a.find(to) != a.end()) a.erase(to);
    }
  }
  cout << ans;
  return 0;
}
