#include <bits/stdc++.h>
using namespace std;
list<int> graph[200001];
int par[200001] = {-1};
set<pair<int, int> > non_reachable;
map<int, int> dist;
void dfs(int node, int p = -1, int h = 0) {
  par[node] = p;
  if (h > 2) {
    non_reachable.insert({-h, node});
    dist[node] = h;
  }
  h++;
  for (list<int>::iterator itr = graph[node].begin(); itr != graph[node].end();
       itr++)
    if (*itr != p) dfs(*itr, node, h);
}
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    int a, b;
    cin >> a >> b;
    graph[a].push_back(b);
    graph[b].push_back(a);
  }
  dfs(1);
  long sol = 0;
  while (!non_reachable.empty()) {
    sol++;
    int node = non_reachable.begin()->second;
    int e = par[node];
    if (non_reachable.find({-dist[e], e}) != non_reachable.end())
      non_reachable.erase({-dist[e], e});
    for (list<int>::iterator itr = graph[e].begin(); itr != graph[e].end();
         itr++)
      non_reachable.erase({-dist[*itr], *itr});
  }
  cout << sol << endl;
  return 0;
}
