// In the name of Allah

#include <bits/stdc++.h>
using namespace std;

typedef		long long int			ll;
typedef		long double				ld;
typedef		pair<int, int>			pii;
typedef		pair<ll, ll>			pll;
typedef		complex<ld>				cld;

#define		all(x)					(x).begin(),(x).end()
#define		len(x)					((ll) (x).size())
#define		F						first
#define		S						second
#define		pb						push_back
#define		sep						' '
#define		endl					'\n'
#define		Mp						make_pair
#define		kill(x)					cout << x << '\n', exit(0)
#define		set_dec(x)				cout << fixed << setprecision(x);
#define		file_io(x,y)			freopen(x, "r", stdin); freopen(y, "w", stdout);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 1e6 + 10 ; 
vector<int> G[maxn] ;
int x =0 ; 

int dfs(int v, int p=0){
	bool ok =0 ;
	for(int u : G[v]){
		if(u == p)continue ; 	
		if(dfs(u ,v) == 0)ok =1 ;
	}
	if(ok == 1){
		x++;
		return 1;
	}else{
		return 0; 
	}
}	

void solve() {
	int n;cin >> n ; 
	for(int i = 1; i <= n-1 ; i++){
		int v,  u;
		cin >> v >> u ;
		G[v].pb(u) ;
		G[u].pb(v) ;
	}
	dfs(1 , 0) ;
	cout << x + (n-2*x) * 2 << "\n" ; 
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	
	int T = 1;
	while (T--) {
		solve();
	}
	
	return 0;
}