#include<bits/stdc++.h>

#define ll long long
#define mk make_pair
#define fi first
#define se second

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

const int mod=998244353;
int ksm(int x,int y,int p=mod){
	int ans=1;
	for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
	return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937 rnd(time(0));
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}
int cmod(int x){if(x>=mod)x-=mod;return x;}

void cmax(int &x,int v){x=max(x,v);}
void cmin(int &x,int v){x=min(x,v);}

void solve(){
	int n=read();
	vector<vector<int> >G(n+1);
	vector<int>f(n+1),g(n+1);
	for(int i=1;i<=n-1;i++){
		int u=read(),v=read();
		G[u].emplace_back(v),G[v].emplace_back(u);
	}
	function<void(int,int)>DP=[&](int u,int fa){
		for(int v:G[u])if(v!=fa)DP(v,u);
		for(int v:G[u])if(v!=fa)g[u]+=f[v];
		f[u]=g[u]+2;
		for(int v:G[u])if(v!=fa)f[u]=min(f[u],g[u]+g[v]-f[v]+1);
		// cout<<"u = "<<u<<" f,g = "<<f[u]<<" "<<g[u]<<endl;
	};
	DP(1,0);
	cout<<f[1]<<endl;
}

signed main(void){

#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
#endif

	solve();

	return 0;
}