#include<bits/stdc++.h>
using namespace std;
signed main(){cin.tie(0)->sync_with_stdio(0);
int n;cin>>n;vector<vector<int>>e(n);
if(n%2==0)return cout<<n,0;
for(int i=0;i<n-1;++i){
	int u,v;cin>>u>>v;--u,--v;
	e[u].push_back(v),e[v].push_back(u);
}
vector<int>d(n),t(n,-1);
auto dfs=[&](auto&self,int u,int f)->void{
	if(d[u]%2==0)t[u]=u;
	for(int v:e[u])if(v!=f){
		d[v]=d[u]+1;
		self(self,v,u);
		t[u]=max(t[u],t[v]);
	}
};dfs(dfs,n-1,-1);
int ans=-1;
for(int i=0;i<n;++i)if(e[i].size()==1||d[i]%2==1)ans=max(ans,i);
vector<int>k;for(int v:e[n-1])if(t[v]!=-1)k.push_back(t[v]);
sort(k.begin(),k.end());
if(k.size()>=3)ans=max(ans,k.end()[-3]);
for(int i=0;i<n-1;++i){
	if(d[i]%2==0){
		k.clear();
		for(int v:e[i])if(t[v]!=-1)k.push_back(t[v]);
		sort(k.begin(),k.end());
		if(k.size()>=2)ans=max(ans,k.end()[-2]);
	}
}
cout<<ans+1;
}