#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using pii = pair<int, int>;

#define vv vector
#define fi first
#define se second
#define eb emplace_back

const int N = 1e5 + 10;
int n;
int col[N];
vv<int> G[N], vec[2];

void dfs(int u, int fath) {
	for (auto v : G[u]) {
		if (v == fath) continue;
		col[v] = col[u] ^ 1;
		dfs(v, u);
	}
}

signed main() {
	#ifndef ONLINE_JUDGE
		freopen("test.in", "r", stdin);
		freopen("test.out", "w", stdout);
	#endif
	cin >> n;
	for (int i = 1; i < n; ++i) {
		int u, v; cin >> u >> v;
		G[u].eb(v); G[v].eb(u);
	}
	if (n % 2 == 0) {
		cout << n << '\n';
		return 0;
	}
	dfs(n, 0);
	int ans = 0;
	for (int i = n; i >= 1; --i) {
		if (col[i] || G[i].size() <= 1) ans = max(ans, i);
		vec[col[i]].eb(i);
	}
	for (int i = 0; i <= 1; ++i) {
		sort(vec[i].begin(), vec[i].end(), [&](int i, int j) -> bool {return i > j;});
		if (vec[i].size() >= 3) ans = max(ans, vec[i][2]);
	}
	if (vec[1].size()) ans = max(ans, vec[0][1]);
	cout << ans << '\n';
	return 0;
}