#include<bits/stdc++.h>
#define ll long long
#define int long long
using namespace std;

const int maxn = 210000;

int n;
vector<int>E[maxn];

int dep[maxn],fa[maxn];
multiset<int>S[maxn];

int ans;
int qmx(multiset<int>&qS)
{
	auto it=qS.end(); it--;
	return *it;
}
void dfs(const int x)
{
	vector<int>son;
	for(auto y:E[x]) if(y!=fa[x])
	{
		fa[y]=x; dep[y]=dep[x]+1;
		son.push_back(y);
		dfs(y);
	}
	if(son.size()>0)
	{
		if(son.size()==1)
		{
			ans+= S[son[0]].size()-1;
			S[x].insert(dep[x]+1);
		}
		else
		{
			int mxdep=min( qmx(S[son[0]]), qmx(S[son[1]]) )+1;
			
			S[x].swap(S[son[0]]);
			int y=son[1];
			if(S[x].size()<S[y].size()) S[x].swap(S[y]);
			for(auto c:S[y]) S[x].insert(c);
			
			while(S[x].size()>0)
			{
				auto it=S[x].end(); it--;
				if(*it>mxdep)
				{
					ans++;
					S[x].erase(it);
				}
				else break;
			}
		}
	}
		
	S[x].insert(dep[x]);
}

signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	cin>>n;
	for(int i=1;i<n;i++)
	{
		int x,y; cin>>x>>y;
		E[x].push_back(y);
		E[y].push_back(x);
	}
	dep[1]=1; dfs(1);
	
	cout<<ans<<endl;
	
	return 0;
}