#include<bits/stdc++.h>
#include<queue>
#define N 100000
using namespace std;
int n,ans,deep[N+5],fa[N+5];
vector<int> e[N+5],v[N+5];
inline void dfs(int x)
{
	if(!(deep[x]=deep[fa[x]]^1)) ans=max(ans,x);
	for(int y:e[x]) if(y!=fa[x]) fa[y]=x,dfs(y);
	sort(v[x].begin(),v[x].end(),greater<int>());
	if(x!=n && deep[x] && v[x].size()>1) ans=max(ans,v[x][1]);
	if(x==n && v[x].size()>2) ans=max(ans,v[x][2]);
	v[fa[fa[x]]].push_back(v[x].empty() || x>v[x][0]?x:v[x][0]);
}
int main()
{
	scanf("%d",&n);
	for(int i=1,u,v;i<n;++i)
	{
		scanf("%d %d",&u,&v);
		e[u].push_back(v);
		e[v].push_back(u);
	}
	if(!(n&1)) return printf("%d\n",n),0;
	for(int i=n;i;--i) if(e[i].size()==1) {ans=i;break;}
	dfs(n),printf("%d\n",ans);
	return 0;
}