#include <bits/stdc++.h>
#include <bits/extc++.h>
#define int long long
char freadgetchar(){
	static char buf[100000],*p1=buf,*p2=buf;
	if(p1==p2){
		p2=(p1=buf)+fread(buf,1,100000,stdin);
		if (p1==p2)return EOF;
	}
	return *p1++;
}
void read(int&x){
	static char c;
	c=freadgetchar();
	int b=1;
	for(x = 0;!(c>='0'&&c<='9');c=freadgetchar()) if(c == '-') b = -b;
	for(;c>='0'&&c<='9';x=x*10+c-'0',c=freadgetchar());x*=b;
}
const int MAXN=3e5+5;
std::vector<int> g[MAXN];
int n,ff[MAXN];
int G,mxg=1e18;
int sz[MAXN];
int d[MAXN],ans[MAXN];
void dfs1(int x,int fa){
	sz[x]=1;
	int mx=0;
	for(auto v:g[x]){
		if(v==fa)continue;
		dfs1(v,x);
		d[x]+=d[v]+sz[v];
		sz[x]+=sz[v];
		mx=std::max(mx,sz[v]);
	}
	mx=std::max(mx,n-sz[x]);
	if(mx<mxg)G=x,mxg=mx;
}
void dfs2(int x,int f){
	for(auto v:g[x]){
		if(v==f)continue;
		ans[v]=ans[x]-sz[v]+n-sz[v];
		dfs2(v,x);
	}
}
signed main(){
	std::cin>>n;
	
	for(int i=2;i<=n;i++){
		int u,v;
		std::cin>>u>>v;
		g[u].emplace_back(v);
		g[v].emplace_back(u);
	}
	dfs1(1,0);
	ans[1]=d[1];
	dfs2(1,0);
	int sum=0;
	for(int i=1;i<=n;i++){
		sum+=ans[i];
		//std::cout<<ans[i]<<'\n';
	}
	//std::cout<<G<<'\n';
	std::cout<<sum-2*ans[G]<<'\n';
	return 0;
}