#include <bits/stdc++.h>

#include <ctime>

#define int long long

#define double long double

#define INF LONG_LONG_MAX

#define maxn 300005

#define fr read()

#define pii pair<int,int>

#define eps -1e6

using namespace std;

int n;

vector<pair<int,int> > z[maxn];

int sz[maxn],ans[maxn],d[maxn];

int G,mxg = INF;

void dfs1(int x,int f){
	
	int mx = 0;
	
	sz[x] = 1;
	
	for(int i = 0;i < z[x].size();++ i){
		
		int v = z[x][i].first;
		
		if(v == f) continue;
		
		dfs1(v,x);
		
		d[x] += d[v] + sz[v];
		
		sz[x] += sz[v];
		
		mx = max(mx,sz[v]);
		
	}
	
	mx = max(mx,n - sz[x]);
	
	if(mx < mxg) G = x,mxg = mx;
	
	return ;
	
}

void dfs2(int x,int f){
	
	for(int i = 0;i < z[x].size();++ i){
		
		int v = z[x][i].first;
		
		if(v == f) continue;
		
		ans[v] = ans[x] - sz[v] + n - sz[v];
		
		dfs2(v,x);
		
	}
	
	return ;
	
}

signed main() {
	
	ios::sync_with_stdio(0);
	
	cin.tie(0);
	
	cout.tie(0);
	
	cin >> n;
	
	for(int i = 1;i < n;++ i){
		
		int s,e;
		
		cin >> s >> e;
		
		z[s].push_back({e,1});
		
		z[e].push_back({s,1});
		
	}
	
	dfs1(1,0);
	
	ans[1] = d[1];
	
	dfs2(1,0);
	
	int anss = 0;
	
	for(int i = 1;i <= n;++ i){
		
		if(i != G) anss += ans[i];
		
	} 
	
	cout << anss - ans[G] << "\n";
	
	return 0;
	
}