#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define xl F[x].son[0]
#define xr F[x].son[1]
#define fir first
#define sec second
#define bug cout<<"bugbugbugbug"<<endl;
using namespace std;
void kuaidu(){ios::sync_with_stdio(false),cin.tie(0);}
inline int max(int a,int b){ if(a<b) return b; return a;}
inline int min(int a,int b){ if(a<b) return a; return b;}
const int N=1e5+10;
const int M=1e6+10;
const int mod=1e9+7;
const int INF=1e16;
typedef pair<int,int> PII;
int n,m,T;
vector<int> A[N];
int son[N];
int dp[N][50];
void dfs(int x,int pa){
	son[x]=1;
	int x1=0,x2=0;
	for(auto y:A[x]){
		if(y==pa) continue;
		dfs(y,x);
		son[x]+=son[y];
		if(x1) x2=y;
		else x1=y;
	}
	dp[x][1]=son[x]-1;
	dp[x][0]=son[x];
	if(x1 && x2){
		for(int i=2;i<50;i++){
			for(int o=1;o<=2;o++)
				for(int p=1;p<=2;p++){
					if(o==2 && p==2) continue;
					dp[x][i]=min({dp[x][i],dp[x1][i-o]+dp[x2][i-p]});
				}
		}
	}
	else if(x1){
		dp[x][2]=son[x]-2;
	}
}

signed main(){
	kuaidu();
//	T=1;cin>>T;while(T--){}
	memset(dp,0x3f,sizeof dp);
	cin>>n;
	for(int i=1;i<n;i++){
		int a,b;
		cin>>a>>b;
		A[a].push_back(b);
		A[b].push_back(a);
	}
	dfs(1,1);
	int ans=INF;
	for(int i=0;i<50;i++) ans=min(ans,dp[1][i]);
	cout<<ans<<endl;
	return 0;
}