#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200500;
const int INF = 0x3f3f3f3f;
int dist[MAXN], par[MAXN];
bool used[MAXN];
vector<int> G[MAXN];
vector<pair<int, int> > node;
void setup() {
  memset(dist, INF, sizeof(dist));
  memset(par, -1, sizeof(par));
  memset(used, false, sizeof(used));
}
bool comp(pair<int, int> p1, pair<int, int> p2) {
  return (p1.first > p2.first);
}
void bfs(int start) {
  queue<int> Q;
  Q.push(start);
  dist[start] = 0;
  int curr;
  while (!Q.empty()) {
    curr = Q.front();
    Q.pop();
    if (dist[curr] <= 2) used[curr] = true;
    for (auto v : G[curr])
      if (dist[v] == INF) {
        par[v] = curr;
        dist[v] = dist[curr] + 1;
        node.push_back({dist[v], v});
        Q.push(v);
      }
  }
}
void update(int curr) {
  used[curr] = true;
  for (auto v : G[curr]) used[v] = true;
}
int main() {
  setup();
  int N, u, v;
  cin >> N;
  for (int i = 0; i < N - 1; i++) {
    cin >> u >> v;
    G[u].push_back(v);
    G[v].push_back(u);
  }
  bfs(1);
  sort(node.begin(), node.end(), comp);
  int br = 0;
  for (auto x : node) {
    if (!used[x.second]) {
      update(par[x.second]);
      br++;
    }
  }
  cout << br << endl;
  return 0;
}
