#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define N 300010
//using LL = __int128
ll n, u, v, g, sz[N], dis[N], fa[N], sum[N];
vector<ll> e[N];
void dfs(int u, int f){
	fa[u] = f;
	sz[u] = 1;
	for(auto v : e[u]){
		if(f == v)
			continue;
		dfs(v, u);
		dis[u] += dis[v] + sz[v];
		sz[u] += sz[v];
	}
}
void dfs2(int u, int f){
	for(auto v : e[u]){
		if(f == v)
			continue;
		sum[v] = sum[u] + n - 2ll * sz[v];
		dfs2(v, u);
	}
}
int main(){
	scanf("%lld", &n);
	for(int i = 1 ; i < n ; i++){
		scanf("%lld%lld", &u, &v);
		e[u].push_back(v);
		e[v].push_back(u);
	}
	dfs(1, 1);
	sum[1] = dis[1];
	g = 1;
	dfs2(1, 1);
	ll ans = 0;
	for(int i = 1 ; i <= n ; i++){
		ans += sum[i];
		if(sum[i] < sum[g])
			g = i;
		//cout << sum[i] << " \n"[i == n];
	}
	printf("%lld", ans - sum[g] * 2ll);
	return 0;
}