#include<bits/stdc++.h>
using namespace std;
void solve()
{
	int n;
	cin>>n;
	vector<map<int,int>>g(n+1);
	vector<int>d(n+1);
	for(int i = 0;i<n-1;i++){
		int a,b;cin>>a>>b;
		g[a][b]++;
		g[b][a]++;
		d[a]++,d[b]++;
	} 
	int cnt = 0;
	function<bool(int,int)> dfs = [&](int u,int fa)->bool{
		bool ok = true;
		for(auto x:g[u]){
			int v = x.first;
			if(v==fa)continue;
			ok &= dfs(v,u);
		}
		
		if(ok==false){
			return true;
		}
		if(d[fa]==1||d[fa]==2){
			cnt++;	
			d[u]--;
			return false;
		}
		d[fa]--;
		//cout<<fa<<" "<<"\n";
		cnt+=2;
		d[u]--;
		return true;
		
	};
	
	dfs(1,0);
	cout<<cnt<<"\n";
	
	
	
}
int main()
{
	cin.tie(0)->sync_with_stdio(0);
	int t = 1;
	while(t--)solve();
}