#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 9;
int head[maxn];
struct node {
  int u, v, nxt;
} edge[2 * maxn];
int cnt = 0;
void addedge(int u, int v) {
  edge[++cnt].u = u;
  edge[cnt].v = v;
  edge[cnt].nxt = head[u];
  head[u] = cnt;
}
int fa[maxn];
int dis[maxn];
void dfs(int cur, int nod) {
  if (dis[nod] != -1 && cur != 0) return;
  dis[nod] = cur;
  for (int i = head[nod]; i; i = edge[i].nxt) {
    dfs(cur + 1, edge[i].v);
    fa[edge[i].v] = nod;
  }
  return;
}
int main() {
  int n;
  cin >> n;
  set<int> ss;
  bool vis[maxn];
  memset(dis, -1, sizeof(dis));
  memset(vis, 0, sizeof(vis));
  fa[1] = 1;
  priority_queue<pair<int, int> > pq;
  pq.push({dis[1], 1});
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    addedge(u, v);
    addedge(v, u);
  }
  dfs(0, 1);
  for (int i = 1; i <= n; i++) {
    if (dis[i] > 2) pq.push({dis[i], i});
    ss.insert(i);
  }
  int ans = 0;
  while (pq.size()) {
    pair<int, int> pp = pq.top();
    pq.pop();
    if (pp.first <= 2) continue;
    if (vis[pp.second]) continue;
    for (int i = head[fa[pp.second]]; i; i = edge[i].nxt) {
      ss.erase(edge[i].v);
      vis[edge[i].v] = 1;
    }
    ss.erase(fa[pp.second]);
    vis[fa[pp.second]] = 1;
    ans++;
  }
  printf("%d", ans);
  return 0;
}
