#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 5;
int head[maxn], fa[maxn], dis[maxn], ans, t1, t2, tot, n, t[maxn], vis[maxn], out[maxn];
struct node {
	int v, pre;
}e[maxn << 1];
void add(int u, int v) {
	e[++ tot].v = v;
	e[tot].pre = head[u];
	head[u] = tot;
}
void dfs(int now, int f) {
	fa[now] = f;
	for(int i = head[now];i;i = e[i].pre) {
		int v = e[i].v;
		if(v == f) continue;
		dis[v] = dis[now] ^ 1;
		dfs(v, now);
	}
}
int main() {
	scanf("%d", &n);
	if(n % 2 == 0) {
		printf("%d\n", n);
		return 0;
	}
	for(int i = 1, u, v;i < n;i++) {
		scanf("%d%d", &u, &v);
		add(u, v), add(v, u);
		out[u] ++, out[v] ++;
	}
	dfs(n, 0);
	for(int i = n - 1;i >= 1;i--) {
		if(dis[i] || out[i] == 1) {
			printf("%d\n", i);
			return 0;
		}
		int now = i;
		while(1) {
			t[now] ++;
			if(vis[now]) break;
			vis[now] = 1;
			now = fa[now];
			t[now] ++; 
		}
//		cout << now << " " << t[now] << endl;
		if(t[now] > 2 && !dis[now]) {
			printf("%d\n", i);
			return 0;
		}
	}
	printf("%d\n", max(ans, min(t1, t2)));
}