#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//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; }
#include<vector>
#include<iostream> 
template <typename Cost, typename Data, Data(*merge)(const Data&, const Data&), Data(*mergeR)(const Data&, const Data&), Data(*e)()>
struct ReRooting {
	struct Edge {
		int to;
		Cost cost;
		Edge(int _to, Cost cost = 1) :to(_to), cost(cost) {}
	};
	std::vector<std::vector<Edge>>g;
	std::vector<Data>dp;
	std::vector<Data>ans;
	int sz;
	ReRooting(int _sz) :sz(_sz) {
		g.resize(sz);
		dp.reserve(sz);
		ans.resize(sz);
	}

	void addEdge(int s, int t, Cost c = 1) {
		g[s].emplace_back(t, c);
		g[t].emplace_back(s, c);
	}

	void dfs(int v, int p = -1) {
		dp[v] = e();
		for (Edge &edge : g[v]) {
			if (p == edge.to)continue;
			dfs(edge.to, v);
			dp[v] = merge(dp[v], dp[edge.to]);
		}
	}
	void dfsR(int v, int p = -1) {
		ans[v] = dp[v];
		if (-1 != p)ans[v] = merge(ans[v], dp[p]);
		for (Edge edge : g[v]) {
			if (p == edge.to)continue;
			dp[v] = mergeR(ans[v], dp[edge.to]);
			dfsR(edge.to, v);
		}
	}
	std::vector<Data> solve() {
		dfs(0);
		dfsR(0);
		return ans;
	}
};
using Cost = int;
struct Data {
	int val0 = 0;
	int val1 = 0;
	Data(int val0 = 0, int val1 = 0) :val0(val0), val1(val1) {}
};
Data e() { return Data(0, 1); }
Data merge(const Data &lh, const Data &rh) {
	Data ret = lh;
	ret.val0 += max(rh.val0, rh.val1);
	ret.val1 += rh.val0;
	return ret;
}
Data mergeR(const Data &lh, const Data &rh) {
	Data ret = lh;
	ret.val0 -= max(rh.val0, rh.val1);
	ret.val1 -= rh.val0;
	return ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	ReRooting<Cost, Data, merge, mergeR, e> g(n);
	rep(i, n - 1) {
		int u, v; cin >> u >> v;
		u--, v--;
		g.addEdge(u, v);
	}
	auto ret = g.solve();
	int ans = n;
	rep(i, n)chmin(ans, ret[i].val1);
	cout << ans << endl;
	return 0;
}