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

int cnt = 0;

int dfs(vector<int> tree[], int cur, int prev) {
  int sum = 0;
  for (int nei : tree[cur]) {
    if (nei != prev) {
      sum += dfs(tree, nei, cur);
    }
  }

  if (sum > 0) {
    cnt += (sum - 1) * 2 + 1;
    return 0;
  } else {
    return 1;
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);

  int n;
  cin >> n;
  vector<int> tree[n];
  vector<int> deg(n);
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    u--; v--;
    tree[u].push_back(v);
    tree[v].push_back(u);
    deg[u]++;
    deg[v]++;
  }

  int root = 0;
  for (int i = 1; i < n; i++) {
    if (deg[i] > deg[root]) {
      root = i;
    }
  }

  if (root <= 2) {
    if (n % 2 == 0) {
      cout << n / 2 << endl;
    } else {
      cout << n / 2 + 2 << endl;
    }
  } else {
    int ret = dfs(tree, root, -1);
    if (ret == 1) {
      cnt += 2;
    }
    cout << cnt << endl;
  }
}