#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
vector<int>V[1000000+5];
int n;
bool vis[1000000+5];
int c[1000000+5];
vector<int>Q;
void build(int root)
{
	if(V[root].size()==1) 
		Q.push_back(root);
	else
		for(auto p:V[root])
			if(!vis[p])
			{
				vis[p]=true;
				c[p]=c[root]+1;	
				build(p);
			}
			
} 
int main()
{
	scanf("%d",&n);
	int x,y;
	for(int i=1;i<n;i++)
	{
		scanf("%d %d",&x,&y);
		V[x].push_back(y);
		V[y].push_back(x);
	}
	c[1]=0;
	vis[1]=true;
	long long ans=0;
	build(1);
	for(auto p:Q)
		ans+=c[p]*1LL;
	printf("%lld",ans);
	return 0;
}