#include<bits/stdc++.h>
#ifdef LOCAL
#include "Essentials/algo/debug.h"
#else
#define debug(...)    69
#define debugArr(...)  69
#endif
using namespace std;

typedef long long     ll;
typedef pair<int,int> pii;
typedef pair<ll,ll>   pll;


#define F           first
#define S           second
#define pb          push_back
#define kill(x)     cout<<x<<endl, exit(0);
#define all(x)      x.begin(),x.end()
#define sz(x)       (int)x.size()
#define lc          (v << 1)
#define rc          ((v<<1) |1)

const int N = 2e5+23; 
const ll INF=1e18+23; 
vector<int> g[N]; 

ll dp[N][2]; 
int n; 

void dfs(int v, int p=0){
	vector<int> ch; 
	for (int u: g[v]){
		if(u==p) continue; 
		ch.pb(u); 
		dfs(u, v); 
	}
	
	dp[v][1]=0; 
	for (int u: ch) dp[v][1]+=dp[u][0]; 
	
	dp[v][0]=dp[v][1]+2; 
	
		
		ll sum=0; 
		ll Mn=INF; 
		for (int u: ch){
			sum+=dp[u][0]; 
			Mn=min(Mn, dp[0][1]-dp[u][0]); 
		}
		dp[v][0]=min(dp[v][0], sum+Mn+1); 
	
	
	
	
}



int32_t main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    cin>>n; 
    if(n==1)return cout<<2<<endl, 0; 
    for (int i=0; i<n-1; i++){
    	int v, u; cin>>v>>u; 
    	g[v].pb(u); g[u].pb(v); 
    	
    }
    
    int r=-1; 
    for (int i=1; i<=n; i++) if(g[i].size()>2) r=i; 
    
    if(r==-1)return	cout<<(n+1)/2<<endl, 0;
    	
    dfs(r); 
    
    cout<<dp[r][0]<<endl;
	
	return 0;
}

// Jumpsuit, Jumpsuit cover me!
// Jumpsuit, Jumpsuit cover me!