#include<bits/stdc++.h>
inline void read(int &x){
	x=0;char ch=getchar();
	while(!isdigit(ch))ch=getchar();
	while(isdigit(ch)){
		x=(x<<1)+(x<<3)+(ch^48);
		ch=getchar();
	}
}
using namespace std;
const int maxn=1e6+10;
int n,rt,dep[maxn],dp[maxn][2];
vector<int>e[maxn<<1];
void dfs(int u,int fa){
	dep[u]=dep[fa]+1;
	int siz=0;
	for(int v:e[u]){
		if(v==fa)continue;
		siz++;
		dfs(v,u);
		dp[u][0]+=min(dp[v][0],dp[v][1]+1);
		dp[u][1]+=min(dp[v][1],dp[v][0]+1);
	}
	if(!siz){
		dp[u][dep[u]&1]=1;
	}
}
int main(){
	srand((unsigned)time(NULL));
	read(n);
	for(int i=1;i<n;i++){
		int u,v;
		read(u),read(v);
		e[u].push_back(v),e[v].push_back(u);
	}
	int cnt=0;
	for(int i=1;i<=n;i++){
		if(e[i].size()==1)cnt++;
	}
	if(cnt==2){
		cout<<((n&1)^1)<<'\n';
		return 0;
	}
	rt=rand()%n+1;
	dfs(rt,0);
	int ans=min(dp[rt][0],dp[rt][1]);
	memset(dp,0,sizeof(dp));
	memset(dep,0,sizeof(dep));
	rt=rand()%n+1;
	dfs(rt,0);
	ans=max(ans,min(dp[rt][0],dp[rt][1]));
	cout<<ans<<'\n';
	return 0;
}