# include <bits/stdc++.h>

# define int long long

using namespace std;

int n;

int u[300005], v[300005];

int dep[300005]; 

vector < int > vec[300005];

inline void add (int u, int v) {
	
	vec[u].push_back (v);
	
	vec[v].push_back (u);
	
}

int ans, anss = 2147483647;

int size[300005];

inline void dfs (int u, int fa) {
	
	int sum = 0;
	
	size[u] = 1;
	
	dep[u] = dep[fa] + 1;
	
	for (int i = 0; i < vec[u].size (); ++ i) {
		
		int v = vec[u][i];
		
		if (v == fa) continue;
		
		dfs (v, u);
		
		sum = max (sum, size[v]);
		
		size[u] += size[v];
		
	}
	
	sum = max (sum, n - size[u]);
	
	if (sum < anss) {
		
		anss = sum, ans = u;
		
	}
	
}

int nw = 0;

bool vis[300005];

inline void bfs (int s) {
	
	queue < pair < int, int > > q;
	
	q.push (make_pair (s, 0));
	
	vis[s] = 1;
	
	while (! q.empty ()) {
		
		pair < int, int > uu = q.front ();
		
		int w = uu.second;
		
		int u = uu.first;
		
		q.pop ();
		
		for (int i = 0; i < vec[u].size (); ++ i) {
			
			int v = vec[u][i];
			
			if (vis[v]) continue;
			
			pair < int, int > nww = make_pair (v, w + 1);
			
			nw += w + 1;
			
			vis[v] = 1;
			
			q.push (nww);
			
		}
		
	}
	
}

signed main () {
	
	scanf ("%lld", &n);
	
	for (int i = 1; i < n; ++ i) {
	
		scanf ("%lld %lld", &u[i], &v[i]);
		
		add (u[i], v[i]);
		
	}
	
	dfs (1, 0);
	
	bfs (ans);
	
	int nwans = 0;
	
	for (int i = 1; i < n; ++ i) {
		
		if (dep[u[i]] > dep[v[i]]) swap (u[i], v[i]);
		
		nwans += 2 * size[v[i]] * (n - size[v[i]]);
		
	}
	
	printf ("%lld\n", nwans - 2 * nw);
	
	return 0;
	
}