#include <fstream>

#define I_F "vacation.in"
#define O_F "vacation.out"

const int MAXn=50000;

struct lb
{
	int x;
	lb *next;
}*map[MAXn]={NULL};
int n;
int ans[2]={0};

void Input();
void Dfs(const int, const int, const bool);
void Output();

int main()
{
	Input();
	Dfs(0,-1,false);
	Output();
	return 0;
}

void Input()
{
	lb *temp;
	int x,y;
	std::ifstream fin(I_F);
	fin>>n;
	for (short i=1; i<n; i++)
	{
		fin>>x>>y;
		x--, y--;
		temp=map[x];
		map[x]=new lb;
		map[x]->x=y;
		map[x]->next=temp;
		temp=map[y];
		map[y]=new lb;
		map[y]->x=x;
		map[y]->next=temp;
	}
	fin.close();
}

void Dfs(const int x, const int y, const bool f)
{
	ans[f]++;
	for (lb *i=map[x]; i!=NULL; i=i->next)
		if (i->x!=y)
			Dfs(i->x,x,!f);
}

void Output()
{
	std::ofstream fout(O_F);
	if (ans[0]>ans[1])
		fout<<ans[0]<<std::endl;
	else
		fout<<ans[1]<<std::endl;
	fout.close();
}