/* -*- coding: utf-8 -*-
 *
 * 3514.cc:  No.3514 Majority Driven Tree - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 100000;
const int INF = 1 << 30;

/* typedef */

using vi = vector<int>;

/* global variables */

vi nbrs[MAX_N], dvs[MAX_N];
int ps[MAX_N], cis[MAX_N], ss1[MAX_N], dss[MAX_N];
int dp0[MAX_N], dp1[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    u--, v--;
    nbrs[u].push_back(v);
    nbrs[v].push_back(u);
  }

  ps[0] = -1;
  for (int u = 0; u >= 0;) {
    auto &nbru = nbrs[u];
    int up = ps[u];

    if (cis[u] < nbru.size()) {
      int v = nbru[cis[u]++];
      if (v != up) {
	ps[v] = u;
	u = v;
      }
    }
    else {
      auto &dvu = dvs[u];
      int cn = dvu.size();
      sort(dvu.begin(), dvu.end());
      for (int i = 0; i < cn; i++) dss[i + 1] = dss[i] + dvu[i];

      int l = (int)nbru.size() / 2 + 1;
      dp0[u] = min(1 + ss1[u],
		   (l <= cn) ? dss[l] + ss1[u] : INF);
      dp1[u] = dss[l - 1] + ss1[u];

      if (up >= 0) {
	ss1[up] += dp1[u];
	dvs[up].push_back(dp0[u] - dp1[u]);
      }
      
      u = up;
    }
  }

  printf("%d\n", dp0[0]);
  
  return 0;
}