#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
const int N = 1e6+12,INF=1e9+7;
vector <int> g[N],cycle,v;
bool vis[N],bas[N];
int ans[N],pos,dis[N],coun;
void dfs(int x,int p){
vis[x] = 1;
int i,j;
v.pb(x);
for (i=0;i<g[x].size();++i){
int to = g[x][i];
if (vis[to] == 1 && to != p){
bool f=0;
for (j=0;j<v.size();++j){
if (v[j] == to)f=1;
if (f){
cycle.pb(v[j]);
}
}
}
if (vis[to] == 0){
dfs(to,x);
}
}
v.pop_back();
}
void dis_dfs(int x,int p,int cnt){
int i,mx = 0;
dis[pos] = max(dis[pos],cnt);
for (i=0;i<g[x].size();++i){
int to = g[x][i];
if (bas[to] || to == p)continue;
dis_dfs(to,x,cnt+1);
}
}
int maax;
void ans_dfs(int x,int p,int cnt){
int i = 0;
if (cnt == maax) coun++;
for (i=0;i<g[x].size();++i){
int to = g[x][i];
if (bas[to] || to == p)continue;
ans_dfs(to,x,cnt+1);
}
}
main(){
int n,m,i,j;
scan1(n)
for (i=1;i<=n;++i){
int x,y;
scan2(x,y)
g[x].pb(y);
g[y].pb(x);
}
dfs(1,0);
for (i=0;i<cycle.size();++i){
bas[cycle[i]]=1;
}
for (i=0;i<cycle.size();++i){
pos=cycle[i];
dis_dfs(cycle[i],0,0);
maax = max(maax,dis[pos]);
}
for (i=0;i<cycle.size();++i){
ans_dfs(cycle[i],0,0);
}
cout <<coun*2;
}
