#include <bits/stdc++.h>
using namespace std;
struct node {
  int u, dep;
  bool operator<(const node &p) const { return dep < p.dep; }
};
priority_queue<node> q;
int dis[200500], n, pa[200500];
bool vis[200500];
vector<int> sq[200500];
void dfs(int u, int fa) {
  pa[u] = fa;
  int len = sq[u].size(), i;
  for (i = 0; i < len; i++) {
    int v = sq[u][i];
    if (v != fa) {
      dis[v] = dis[u] + 1;
      if (dis[v] <= 2)
        vis[v] = 1;
      else
        q.push((node){v, dis[v]});
      dfs(v, u);
    }
  }
}
int main() {
  scanf("%d", &n);
  int i;
  for (i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    sq[u].push_back(v);
    sq[v].push_back(u);
  }
  dis[1] = 0;
  memset(vis, 0, sizeof(vis));
  memset(pa, 0, sizeof(pa));
  dfs(1, 0);
  int ans = 0;
  while (!q.empty()) {
    node p = q.top();
    q.pop();
    int u = p.u;
    if (vis[u]) continue;
    int fa = pa[u], len = sq[fa].size();
    vis[fa] = 1;
    ans++;
    for (i = 0; i < len; i++) vis[sq[fa][i]] = 1;
  }
  printf("%d\n", ans);
  return 0;
}
