#include<bits/stdc++.h>
#define gt getchar
#define pt putchar
#define int long long
#define ull unsigned long long
#define fst first
#define snd second
#define L(x) x<<1
#define R(x) x<<1|1
using namespace std;
typedef pair<int,int> pii;
const double eps=1e-6;
inline bool pts(char ch){return ch>=48&&ch<=57;}
inline int read(){
	bool f=0;int x=0;char ch;
	ch=gt();
	while(!pts(ch)&&ch!=EOF){if(ch=='-')f=1;ch=gt();}
	while(pts(ch)){x*=10;x+=(ch-48);ch=gt();}
	if(f)return -x;
	else return x;
}
template<class T>
inline void print(T x){
	char s[114];
	int top=0;
	if(x<0)pt('-');
	do{
		top++;
		if(x>=0)s[top]=(x%10)+48;
		else s[top]=(-(x%10)+48);
		x/=10;
	}while(x);
	while(top){pt(s[top]);top--;}
}
const int MAXN=3e5+10;
int sz[MAXN],d[MAXN],ans[MAXN];
int n,G,mxg=0x7fffffff;;
vector<int>g[MAXN];
void add_edge(int s,int e){
    g[s].push_back(e);
}
void dfs1(int x,int f){ 
    sz[x]=1;
    int mx=0;
    for(auto v:g[x]){
        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;
}
void dfs2(int x,int f){
    ans[1]=d[1];
    for(auto v:g[x]){
        if(v==f)continue;
        ans[v]=ans[x]-sz[v]+n-sz[v];
        dfs2(v,x);
    } 
}
signed main(){
    n=read();
    for(int i=1;i<=n;i++){
        int s=read(),e=read();
        add_edge(s,e);
        add_edge(e,s);
    }
    dfs1(1,0);
    dfs2(1,0);
    int sum=0;
    for(int i=1;i<=n;i++)
        if(i!=G)sum+=ans[i];
    cout<<sum-ans[G];
    return 0;
}