#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10, M = 4e5 + 10;
int head[N], ver[M], nxt[M], tot = 0;
void add(int x, int y) {
  ver[++tot] = y;
  nxt[tot] = head[x];
  head[x] = tot;
}
int dep[N], fa[N];
void dfs(int x, int c, int f) {
  dep[x] = c;
  fa[x] = f;
  for (int i = head[x]; i; i = nxt[i]) {
    int y = ver[i];
    if (y == f) continue;
    dfs(y, c + 1, x);
  }
}
bool vis[N];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    add(x, y);
    add(y, x);
  }
  dfs(1, 0, 0);
  priority_queue<pair<int, int> > que;
  for (int i = 1; i <= n; i++) {
    if (dep[i] > 2)
      que.push(make_pair(dep[i], i));
    else
      vis[i] = 1;
  }
  int ans = 0;
  while (!que.empty()) {
    int x = que.top().second;
    que.pop();
    if (vis[x]) continue;
    x = fa[x];
    vis[x] = 1;
    ans++;
    for (int i = head[x]; i; i = nxt[i]) vis[ver[i]] = 1;
  }
  printf("%d", ans);
  return 0;
}
