#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<list>
#include<limits.h>
using namespace std;
vector < int > v[300005];
long long treesize[300005];
long long maxxtree = INT_MAX;
int g;
int n;
long long dis_tree[300005];
long long dis_all[300005];
void dfs(int nowx , int fa)
{
	treesize[nowx] = 1;
	long long maxxsize = 0;
	for(int i = 0 ; i < v[nowx].size() ; i++)
	{
		if(v[nowx][i] == fa)
		{
			continue;
		}
		dfs(v[nowx][i] , nowx);
		treesize[nowx] += treesize[v[nowx][i]];
		dis_tree[nowx] += dis_tree[v[nowx][i]] + treesize[v[nowx][i]];
		maxxsize = max(maxxsize , treesize[v[nowx][i]]);
	}
	maxxsize = max(maxxsize , n - treesize[nowx]);
	if(maxxsize < maxxtree)
	{
		maxxtree = maxxsize;
		g = nowx;
	}
}
void calc_dis(int nowx , int fa)
{
	for(int i = 0 ; i < v[nowx].size() ; i++)
	{
		if(v[nowx][i] == fa)
		{
			continue;
		}
		dis_all[v[nowx][i]] = dis_all[nowx] - treesize[v[nowx][i]] + (n - treesize[v[nowx][i]]);
		calc_dis(v[nowx][i] , nowx);
	}
}
signed main()
{
	scanf("%d" , &n);
	for(int i = 1 ; i < n ; i++)
	{
		int x , y;
		scanf("%d%d" , &x , &y);
		v[x].push_back(y);
		v[y].push_back(x);
	}
	dfs(1 , 0);
	dis_all[1] = dis_tree[1];
	calc_dis(1 , 0);
	long long ans = 0;
	for(int i = 1 ; i <= n ; i++)
	{
		if(i == g)
		{
			ans -= dis_all[i];
		}
		else
		{
			ans += dis_all[i];
		}
	}
	cout << ans << endl;
	return 0;
}