#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VVI to(n);
  rep(_, n - 1) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    to[u].emplace_back(v);
    to[v].emplace_back(u);
  }
  auto dfs = [&](auto&& self, int u, int p) -> array<int, 2> {
    VI costs;
    int base = 0;
    for (int v : to[u]) if (v != p) {
      auto r = self(self, v, u);
      base += r[1];
      costs.emplace_back(r[0] - r[1]);
    }
    sort(all(costs));
    array<int, 2> res{1 + base, 1 + base};
    rep(z, 2) {
      res[z] = 1 + base;
      int todo = max<int>(ssize(to[u]) / 2 + 1 - z, 0);
      if (ssize(costs) >= todo) chmin(res[z], accumulate(costs.begin(), costs.begin() + todo, 0) + base);
    }
    return res;
  };
  auto ans = dfs(dfs, 0, -1);
  cout << ans[0] << '\n';
}