#include <bits/stdc++.h>
#define N 100010

using namespace std;

int n, dep[N];

vector <int> g[N], a, b;

inline int read() {
	char ch = getchar(); int x = 0, f = 1;
	while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
	while('0' <= ch && ch <= '9') {x = x * 10 + ch - '0'; ch = getchar();}
	return x * f;
}

void dfs(int u, int fa) {
	if(dep[u] % 2)
		b.push_back(u);
	else
		a.push_back(u);
	for(int v : g[u]) {
		if(v == fa)
			continue;
		dep[v] = dep[u] + 1;
		dfs(v, u);
	}
}

int main() {
	n = read();
	
	for(int i = 1; i < n; i++) {
		int u = read(), v = read();
		
		g[u].push_back(v);
		g[v].push_back(u);
	}
	
	if(n % 2 == 0) {
		cout << n << endl;
		return 0;
	}
	
	dfs(1, 0);
	
	int res = 0;
	for(int i = 1; i <= n; i++)
		if(g[i].size() == 1)
			res = max(res, i);
	
	sort(a.begin(), a.end());
	sort(b.begin(), b.end());
	reverse(a.begin(), a.end());
	reverse(b.begin(), b.end());
	if(b.size() >= 3)
		res = max(res, b[2]);
	if(a.size() && b.size())
		cout << max(res, min(a[0], b[0])) << endl;
	else
		cout << res << endl;
	return 0;
}