/*
Author: Nguyen Chi Thanh - High School for the Gifted - VNU.HCM (i2528)
*/
#include <bits/stdc++.h>
using namespace std;
/* START OF TEMPALTE */
// #define int long long
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define popcount __builtin_popcountll
#define all(x) (x).begin(), (x).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(x) (1ll << (x))
#define SZ(a) ((int32_t)a.size())
#define debug(a, l, r) {for (int _i = (l); _i <= (r); ++_i) cout << (a)[_i] << ' '; cout << '\n';}
template<class X, class Y>
bool minimize(X &x, const Y &y) {
if (x > y) {
x = y;
return true;
} else return false;
}
template<class X, class Y>
bool maximize(X &x, const Y &y) {
if (x < y) {
x = y;
return true;
} else return false;
}
/* END OF TEMPALTE */
const int MAXN = 2e5 + 5;
const int INF = (int)1e9 + 5;
int n, sz[MAXN], ans = INF;
vector<int> adj[MAXN];
multiset<int> szList[MAXN];
void init() {
cin >> n;
for (int i = 1; i < n; ++i) {
int u, v; cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
function<void(int, int)> dfsSz = [&] (int u, int par) {
sz[u] = 1;
for (int v : adj[u]) {
if (v == par) continue;
dfsSz(v, u);
sz[u] += sz[v];
}
};
dfsSz(1, 0);
// debug(sz, 1, n);
}
void update(int a, int b, int c) {
int contrib = max({a, b, c}) - min({a, b, c});
minimize(ans, contrib);
}
void solve() {
function<void(int, int)> dfsSolve = [&] (int u, int par) {
for (int v : adj[u]) {
if (v == par) continue;
dfsSolve(v, u);
if (SZ(szList[u]) < SZ(szList[v]))
swap(szList[u], szList[v]);
for (auto x : szList[v]) {
int target = (n - x) / 2;
auto p = szList[u].upper_bound(target);
if (p != szList[u].end()) {
update(x, *p, n - x - *p);
}
if (p != szList[u].begin()) {
--p;
update(x, *p, n - x - *p);
}
}
for (auto x : szList[v]) szList[u].insert(x);
}
if (u != 1) {
int target = sz[u] / 2;
auto p = szList[u].upper_bound(target);
if (p != szList[u].end()) {
update(n - sz[u], sz[u] - *p, *p);
}
if (p != szList[u].begin()) {
--p;
update(n - sz[u], sz[u] - *p, *p);
}
szList[u].insert(sz[u]);
}
// cout << u << ": ";
// for (auto x : szList[u]) cout << x << ' ';
// cout << '\n';
};
dfsSolve(1, 0);
cout << ans;
}
signed main() {
#ifdef NCTHANH
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(nullptr); cout.tie(nullptr);
init();
solve();
return 0;
}
