#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<vector<int>> to(n);
	rep(i, n - 1) {
		int a, b; cin >> a >> b;
		a--, b--;
		to[a].push_back(b);
		to[b].push_back(a);
	}
	auto dfs = [&](auto &&self, int v, int p = -1)->P {
		int sumdp2 = 0;
		vector<int>diff;
		for (auto nv : to[v]) {
			if (nv == p)continue;
			auto[c0, c1] = self(self, nv, v);
			sumdp2 += c1;
			diff.push_back(c0 - c1);
		}
		sort(all(diff));
		int l = to[v].size() / 2 + 1;
		int dp11 = 1 + sumdp2;
		int dp12 = sumdp2;
		rep(i, l) {
			if (diff.size() <= i)dp12 = INF;
			else dp12 += diff[i];
		}
		int dp1 = min(dp11, dp12);
		int dp22 = sumdp2;
		rep(i, l - 1) dp22 += diff[i];
		auto dp2 = min(dp12, dp22);
		return { dp1,dp2 };
	};
	auto ans = dfs(dfs, 0);
	cout << ans.first << endl;
	return 0;
}