#include <bits/stdc++.h>
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(int i=a;i>=b;i--)
#define Fin(file) freopen(file,"r",stdin)
#define Fout(file) freopen(file,"w",stdout)
using namespace std; using ll = long long;
const int N=1e5+5;
int n,col[N],fa[N],vis[N]; vector<int> to[N];
void dfs(int u,int pa){
	fa[u]=pa; for(int v:to[u]) if(v!=pa) col[v]=3-col[u],dfs(v,u);
}
int main(){
	cin>>n; For(i,1,n-1) { int x,y; cin>>x>>y; to[x].push_back(y); to[y].push_back(x); }
	if(n%2==0||to[n].size()==1u) { cout<<n; exit(0); }
	col[n]=1; dfs(n,0);
	int hh[3]={0}; For(i,1,n) hh[col[i]]=max(hh[col[i]],i);
	int ans=min(hh[1],hh[2]); For(i,1,n) if(to[i].size()==1u) ans=max(ans,i);
	//~ if(n==97687) cout<<hh[1]<<' '<<hh[2]<<'\n';
	vis[n]=1; int cc=1;
	Rev(i,n-1,1) if(col[i]==col[n]){
		cc++; int u=i; while(!vis[u]) vis[u]=1,u=fa[u];
		if(col[u]==col[n]&&cc>2) { ans=max(ans,i); break; }
	}
	cout<<ans;
	return 0;
}