#include <bits/stdc++.h>
using namespace std;
const int MAX = 200005 + 11;
int n;
vector<int> arr[MAX];
int dp[MAX], parent[MAX];
void dfs(int child, int par = -1, int dist = 0) {
  parent[child] = par;
  dp[child] = dist;
  for (auto u : arr[child]) {
    if (u != par) dfs(u, child, dist + 1);
  }
}
void solve() {
  int n;
  cin >> n;
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    arr[u].push_back(v);
    arr[v].push_back(u);
  }
  dfs(0);
  set<pair<int, int>> st;
  for (int i = 0; i < n; i++) {
    if (dp[i] > 2) {
      st.insert(make_pair(dp[i], i));
    }
  }
  int ans = 0;
  while (!st.empty()) {
    auto it1 = st.end();
    it1--;
    int v = (it1)->second;
    v = parent[v];
    ++ans;
    auto it = st.find(make_pair(dp[v], v));
    if (it != st.end()) {
      st.erase(it);
    }
    for (auto to : arr[v]) {
      auto it = st.find(make_pair(dp[to], to));
      if (it != st.end()) {
        st.erase(it);
      }
    }
  }
  cout << ans << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}
