#include <cstdio>
#include <iostream>
#include <vector>
#include <queue>

#define pb push_back

namespace IO {
	template<typename T> inline void rd(T& x) {
		x = 0; bool f = 0; char s = getchar();
		while (s < '0' || s > '9') f |= s == '-', s = getchar();
		while ('0' <= s && s <= '9') x = x * 10 + (s - '0'), s = getchar();
		x = f ? -x : x;
	}
	template<typename T, typename ...Args> inline void rd(T& x, Args& ...args) { rd(x), rd(args...); } 
	template<typename T> inline void wt(T x, char s) {
		int stk[114], top = 0;
		if (x < 0) putchar('-'), x = -x;
		do stk[ ++ top] = x % 10, x /= 10; while (x);
		while (top) putchar(stk[top -- ] + '0');
		putchar(s);
	}
}
using namespace IO;
using namespace std;

typedef pair<int, int> PII;
const int INF = 1e9;
const int N = 1e5 + 7;
vector<int> g[N];
int deg[N], dep[N];
int n;
int res = 0;

inline PII dfs(int u, int fa) {
	priority_queue<int, vector<int>, greater<int> > odd, even;
	dep[u] = dep[fa] + 1;
	if (!(dep[u] & 1)) res = max(res, u);
	for (int v : g[u]) {
		if (v == fa) continue;
		PII A = dfs(v, u);
		odd.push(A.first), even.push(A.second);
	}
	if (u == n) {
		while (even.size() > 1) even.pop();
		while (odd.size() > 2) odd.pop();
		if (odd.size() == 2 && even.size() == 1) res = max(res, min(odd.top(), even.top()));
	}
	else {
		if (dep[u] & 1) {
			while (even.size() > 2) even.pop();
			if (even.size() == 2) res = max(res, even.top());
		}
		else {
			while (even.size() > 1) even.pop();
			while (odd.size() > 1) odd.pop();
			if (odd.size() == 1 && even.size() == 1) res = max(res, min(odd.top(), even.top()));
		}
	}
	if (dep[u] & 1) odd.push(u);
	else even.push(u);
	while (odd.size() > 1) odd.pop();
	while (even.size() > 1) even.pop();
	int x = -INF, y = -INF;
	if (odd.size()) x = odd.top();
	if (even.size()) y = even.top();
	return {x, y};
}

int main() {
	#ifndef ONLINE_JUDGE 
	freopen("in.in", "r", stdin);
	freopen("out.out", "w", stdout);
	#endif
	rd(n);
	if (!(n & 1)) return wt(n, '\n'), 0;
	for (int i = 1; i < n; i ++ ) {
		int u, v; rd(u, v);
		g[u].pb(v), g[v].pb(u);
		deg[u] ++ , deg[v] ++ ;
	}
	for (int i = 1; i <= n; i ++ ) {
		if (deg[i] == 1) res = i;
	}
	dfs(n, 0);
	wt(res, '\n');
	return 0;
}