#include <bits/stdc++.h>
using namespace std;
int gi() {
	int res = 0, w = 1;
	char ch = getchar();
	while (ch != '-' && !isdigit(ch)) ch = getchar();
	if (ch == '-') w = -1, ch = getchar();
	while (isdigit(ch)) res = res * 10 + ch - '0', ch = getchar();
	return res * w;
}
#define fi first
#define se second
#define pii pair<int, int>
using LL = long long;
using db = long double;
const int Mod = 998244353;
const int MAX_N = 1e5 + 5;
vector<int> G[MAX_N];
int N, ans, fa[MAX_N], dep[MAX_N];
void dfs(int x) {
	dep[x] = dep[fa[x]] ^ 1;
	for (int v : G[x])
		if (v != fa[x]) fa[v] = x, dfs(v);
}
int vis[MAX_N];
void solve() {
	N = gi();
	if (N % 2 == 0) return (void)printf("%d\n", N);
	for (int i = 1; i < N; i++) {
		int u = gi(), v = gi();
		G[u].push_back(v), G[v].push_back(u);
	}
	for (int i = 1; i <= N; i++)
		if (G[i].size() == 1) ans = max(ans, i);
	dfs(N);
	for (int i = 1; i <= N; i++)
		if (dep[i] == 0) ans = max(ans, i);
	for (int i = N - 1; i >= 1; i--) {
		if (!dep[i]) continue;
		int o = i;
		while (!vis[o] && o != N) {
			if (o == i) vis[o] += 1;
			else vis[o] += 2;
			o = fa[o];
		}
		vis[o] += 1;
		if (dep[o] == 0 || vis[o] > 2) {
			ans = max(ans, i);
			break;
		}
	}
	printf("%d\n", ans);
}
int main () {
#ifndef ONLINE_JUDGE
    freopen("cpp.in", "r", stdin);
	//freopen("cpp.out", "w", stdout);
#endif
	int T = 1; //T = gi();
	while (T--) {
		solve();
	}
    return 0;
}