#include<iostream>
#include<set>
#include<vector>
using namespace std;
int N;
vector<int>G[2<<17];
multiset<int>ret;
int dfs(int u,int p)
{
	int ch=1;
	multiset<int>now;
	for(int v:G[u])if(v!=p)
	{
		int c=dfs(v,u);
		if(now.size()<ret.size())now.swap(ret);
		for(int d:ret)now.insert(d);
		now.insert(c);
	}
	if(!now.empty())
	{
		auto it=now.end();
		it--;
		ch+=*it;
		now.erase(it);
		if(!now.empty())
		{
			auto it=now.end();
			it--;
			ch+=*it;
			now.erase(it);
		}
	}
	ret.swap(now);
	return ch;
}
main()
{
	cin>>N;
	for(int i=1;i<N;i++)
	{
		int u,v;cin>>u>>v;u--,v--;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	cout<<dfs(0,-1)<<endl;
}