#include<bits/stdc++.h>
using namespace std;
const int N = 3e5 + 5;
const int M = 6e5 + 5;
int fa[25][N],cnt,head[N],n,dis[N],siz[N];
long long ans = 0;
bool is_fixed[N];
struct edge
{
	int to,nxt;
}e[M];
void addedge(int x,int y)
{
	e[++cnt].to = y;
	e[cnt].nxt = head[x];
	head[x] = cnt;	
}
void dfs(int x)
{
	is_fixed[x] = true;
	siz[x] = 1;
	for(int i = head[x];i;i = e[i].nxt)
	{
		if(is_fixed[e[i].to]) continue;
		fa[0][e[i].to] = x;
		dis[e[i].to] = dis[x] + 1;
		dfs(e[i].to);
		siz[x] += siz[e[i].to];
	}
}
int get_lca(int x,int y)
{
	if(dis[x] < dis[y]) swap(x,y);
	for(int i = 20;i >= 0;i--) if(dis[x] - (1 << i) >= dis[y]) x = fa[i][x]; 
	for(int i = 20;i >= 0;i--) 
	{
		if(fa[i][x] != fa[i][y])
		{
			x = fa[i][x];
			y = fa[i][y];
		}
	}
	if(x == y) return x;
	else return fa[0][x];
}
int get_dis(int x,int y)
{
	return dis[x] + dis[y] - 2 * dis[get_lca(x,y)];
}
void dfs2(int x,long long sum)
{
	ans = min(ans,sum);
	for(int i = head[x];i;i = e[i].nxt)
	{
		if(e[i].to == fa[0][x]) continue;
		dfs2(e[i].to,sum - siz[e[i].to] + (n - siz[e[i].to]));
	}
}
signed main()
{
	scanf("%d",&n);
	for(int i = 1;i < n;i++)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		addedge(x,y);
		addedge(y,x);
	}
	dfs(1);
	for(int j = 1;(1 << j) <= n;j++)
	{
		for(int i = 1;i <= n;i++)
		{
			fa[j][i] = fa[j - 1][fa[j - 1][i]];
		}
	}
	long long mid = 0;
	for(int i = 1;i <= n;i++) mid += get_dis(1,i);
	ans = mid;
	dfs2(1,mid);
	ans = -ans;
	for(int i = 1;i <= n;i++) ans += 1ll * siz[i] * (n - siz[i]);
	printf("%lld",ans * 2);
	return 0;
}