#include<iostream>
#include<cstdio>
#include<utility>
#include<map>
#include<algorithm>
#include<set>
#include<vector>

using namespace std;

int _;
int n,m,q,ccf;
int l[200010];
int r[200010];
long long d[200010];
long long ans;

int main()
{
	ios::sync_with_stdio(false);
	cin>>n;
	for (int i=1; i<n; i++)
	{
		cin>>l[i]>>r[i];
		d[l[i]]++;
		d[r[i]]++;
	}
	ans=n-1;
	for (int i=1; i<=n; i++)
	  ans=ans+d[i]*(d[i]-1)/2;
	
	for (int i=1; i<n; i++)
	  ans=ans+(d[l[i]]-1)*(d[r[i]]-1);
	
	cout<<ans;
	return 0;
}