#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 2e5 + 50;
const double eps = 1e-6;
const long long MOD = 1000000007;
int dis[MAXN], fa[MAXN];
bool vis[MAXN];
vector<int> gra[MAXN << 1];
vector<int>::iterator it;
struct node {
  int n, d;
};
priority_queue<node> Q;
bool operator<(node a, node b) { return a.d < b.d; }
void dfs(int u, int f) {
  for (int i = 0; i < gra[u].size(); i++) {
    int opt = gra[u][i];
    if (opt == f) continue;
    fa[opt] = u, dis[opt] = dis[u] + 1;
    dfs(opt, u);
  }
}
int main() {
  memset(vis, false, sizeof(vis));
  memset(dis, 0, sizeof(dis));
  int n;
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    gra[u].push_back(v);
    gra[v].push_back(u);
  }
  dfs(1, 0);
  int ans = 0;
  for (int i = 1; i <= n; i++)
    if (dis[i] > 2) {
      node tm;
      tm.n = i, tm.d = dis[i];
      Q.push(tm);
    }
  while (!Q.empty()) {
    int u = Q.top().n;
    Q.pop();
    if (vis[u]) continue;
    vis[fa[u]] = true, ans++;
    for (it = gra[fa[u]].begin(); it != gra[fa[u]].end(); it++) vis[*it] = true;
  }
  printf("%d\n", ans);
  return 0;
}
