#include<bits/stdc++.h>
using namespace std;
const int N=101000;
int n;
vector<int>G[N];
int dp[N],fdp[N],siz[N];
bool tg[N];
bool flg;
void DFS(int u,int f){
	siz[u]=1;
	for(int v:G[u]){
		if(v==f)continue;
		DFS(v,u);siz[u]+=siz[v];
		if(dp[v]!=-1){
			if(dp[u]==-1)dp[u]=dp[v];
			else dp[u]^=dp[v];
		}
	}
	if(tg[u]&&dp[u]==-1)dp[u]=(siz[u]&1);
	return;
}
void DFS2(int u,int f){
	int sum=0,tmp,cnt=0;
	bool ff=1;
	for(int v:G[u]){
		if(v==f)continue;
		if(dp[v]!=-1)sum^=dp[v],++cnt;
		else ff=0;
	}
	if(fdp[u]==-1)ff=0;
	for(int v:G[u]){
		if(v==f)continue;
		if(dp[v]!=-1)fdp[v]=sum^dp[v];
		else fdp[v]=sum;
		if(cnt==1)fdp[v]=-1;
		if(fdp[u]!=-1)
			if(fdp[v]==-1)fdp[v]=fdp[u];
			else fdp[v]^=fdp[u];
		if(fdp[v]==-1&&tg[u])fdp[v]=(n-siz[v])&1;
		DFS2(v,u);
	}
	if(ff){
		if(tg[u]&&dp[u]!=(siz[u]&1))flg=0;
		if(sum&1)flg=0;
		if(tg[f]&&fdp[u]!=((n-siz[u])&1))flg=0;
	}
	return;
}
bool chk(int t){
	if(!(n&1))return 1;
	for(int i=1;i<=n;i++)tg[i]=(i>=t);
	for(int i=0;i<=n;i++)dp[i]=-1,fdp[i]=-1;
	flg=1;DFS(1,0);if(!flg)return 1;
	DFS2(1,0);if(!flg)return 1;
	return 0;
}
int main()
{
	cin>>n;
	for(int i=1,x,y;i<=n-1;i++){
		scanf("%d %d",&x,&y);
		G[x].push_back(y);G[y].push_back(x); 
	}
	int L=1,R=n;
	while(L<R){
		int mid=(L+R+1)>>1;
		if(chk(mid))L=mid;
		else R=mid-1;
	}cout<<L;
	return 0;
}