#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
const int INF = 200001;
const int TREE_ROOT = 1;
int n, tries_count, dp[N][3];
vector<int> subtries_roots;
vector<int> subtries_parents;
vector<int> g[N];
void find_tries(int v, int p = 0, int depth = 0) {
  for (int u : g[v])
    if (depth == 1) {
      if (u != p && g[u].size() > 1) {
        tries_count++;
        subtries_roots.push_back(u);
        subtries_parents.push_back(v);
      }
    } else
      find_tries(u, v, depth + 1);
}
void dfs(int v, int p) {
  for (int u : g[v]) {
    if (u == p) continue;
    dfs(u, v);
  }
  dp[v][1] = 1;
  dp[v][2] = INF;
  for (int u : g[v]) {
    if (u == p) continue;
    dp[v][1] += min(dp[u][0], min(dp[u][1], dp[u][2]));
    dp[v][0] = min(INF, dp[v][0] + dp[u][2]);
  }
  bool was = 0;
  int best = 0;
  for (int u : g[v]) {
    if (u == p) continue;
    if (dp[u][2] < dp[u][1])
      best += dp[u][2];
    else {
      best += dp[u][1];
      was = 1;
    }
  }
  if (!was) {
    for (int u : g[v]) {
      if (u == p) continue;
      if (dp[u][2] != INF)
        dp[v][2] = min(dp[v][2], best - dp[u][2] + dp[u][1]);
      else
        dp[v][2] = min(dp[v][2], best);
    }
    return;
  } else
    dp[v][2] = best;
  if (dp[v][2] == 0) dp[v][2] = INF;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  find_tries(TREE_ROOT);
  int answer = 0;
  for (int i = 0; i < tries_count; i++) {
    dfs(subtries_roots[i], subtries_parents[i]);
    answer += *min_element(dp[subtries_roots[i]], dp[subtries_roots[i]] + 3);
  }
  cout << answer;
  return 0;
}
