#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int N;
vector<int> e[200000];

int ans = 0;
int dfs(int v, int p) {
  int remain = 0;
  for (auto i : e[v]) {
    if (i == p) continue;
    remain += dfs(i, v);
  }
  if (remain == 0)
    return 1;
  else {
    ans += (remain - 1) * 2;
    ans++;
    return 0;
  }
}

int main() {
  cin >> N;
  for (int i = 0; i < N - 1; i++) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    e[a].push_back(b);
    e[b].push_back(a);
  }

  int remain = dfs(0, -1);
  if (remain == 1) ans++;
  cout << ans << endl;
}