#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define int long long
#define repp(i,x,n) for(int i=x;i<=n;i++)
#define rep(i,x,n) for(int i=x;i>=n;i--)
#define r0 return 0
#define fi first
#define se second
#define liow ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define jelek cout<<"jelek"<<endl
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define tp tuple<int,int,int>
#define fl fflush(stdout)
#define ld long double
#define p5 pair<int,pair<pair<int,int>,pair<int,int>>>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
//const int mod=1e9+7;
const int SQMAX=635,INF=1e18;
const int mod=998244353;
//const int MOD=1e6+3;
mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
pii dr[8]={{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1}};
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int dxx[4]={1,1,-1,-1};
int dyy[4]={1,-1,-1,1};
int mul(int x,int y){return (x%mod*y%mod)%mod;}
int expo(int b,int e){
if(e==0) return 1;
int tmp=expo(b,e/2);
if(e%2) return mul(tmp,mul(tmp,b));
else return mul(tmp,tmp);
}
const int maxn=2e5;
vector<int>adj[maxn+2];
int maks=0;
int sz[maxn+2];
int sais=0;
vector<bool>cyc(maxn+2,1),visi(maxn+2,0);
vector<int>v;
void dfs(int x,int p,int dis){
if(dis>maks){
maks=dis;
sais=1;
} else if(dis==maks){
sais++;
}
for(auto v:adj[x]){
if(!cyc[v] && v!=p) dfs(v,x,dis+1);
}
}
void dfs2(int x,int p,int mul){
v.pb(x);
for(auto v:adj[x]){
if(v==p||v==mul) continue;
if(cyc[v]) dfs2(v,x,mul);
}
}
void solve(){
int n;cin>>n;
vector<int>deg(n+2);
repp(i,1,n){
int u,v;cin>>u>>v;
adj[u].pb(v);
adj[v].pb(u);
deg[u]++,deg[v]++;
}
queue<int>q;
repp(i,1,n) if(deg[i]==1) q.push(i),cyc[i]=0;
while(!q.empty()){
int x=q.front();q.pop();
for(auto v:adj[x]){
if(cyc[v] && deg[v]==1){
q.push(v);
cyc[v]=0;
}
deg[v]--;
}
}
vector<int>sz(n+2),jauh(n+2);
repp(i,1,n){
if(cyc[i]){
maks=0;
sais=0;
dfs(i,0,0);
sz[i]=sais;
jauh[i]=maks;
}
}
int stt;
repp(i,1,n){
if(cyc[i]){
stt=i;
break;
}
}
dfs2(stt,0,stt);
// v idx cycle nya
int ans=0,mx=0;
deque<pii>dq;
int i=0;
multiset<pii>st;
repp(i,0,n/2) dq.push_front({jauh[v[i]]+i,i}),st.insert({jauh[v[i]]+i,i});
int brp=1;
while(1){
i=((i-1)+n)%n;
// cout<<i<<endl;
pii out=dq.back();
dq.pop_back();
if(st.find(out)!=st.end()) st.erase(st.find(out));
int mak=st.rbegin()->fi+brp;
if(mx<jauh[v[i]]+mak){
mx=jauh[v[i]]+mak;
ans=sz[v[i]]+sz[v[st.rbegin()->se]];
} else if(mx==jauh[v[i]]+mak){
ans+=sz[v[i]]+sz[v[st.rbegin()->se]];
}
dq.push_front({v[i]-brp,i});
st.insert({v[i]-brp,i});
brp++;
if(i==0) break;
}
cout<<ans<<endl;
}
signed main(){
liow;
int t=1;
//cin>>t;
while(t--){
solve();
}
}
