#include <iostream>
#include <algorithm>
using namespace std;
int a[100000][2],b,c,d,k[50000]={0},s=0;
struct fun
{
	int p;
	int q;
}r[50000];
int Compare(const void *elem1, const void *elem2) 
{ 
    return *((int *)(elem1)) - *((int *)(elem2));
} 
int main(void)
{
	freopen ("vacation.in","r",stdin);
	freopen ("vacation.out","w",stdout);
	scanf("%d",&b);
	for (c=0;c<b-1;c++) 
	{
		cin>>r[c].p>>r[c].q;
		a[r[c].p-1][0]=r[c].q;
		a[r[c].q-1][1]=r[c].p;
		k[r[c].p-1]++;
		k[r[c].q-1]++;
	}
	qsort(k,b,sizeof(int),Compare);
	d=b;
	for (c=0;c<b;c++)
	{
		b-=k[c];
		s+=k[c];
		
	}
	printf("%d",s);
	fclose(stdin);
	fclose(stdout);
	return 0;
}