#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
using ll = long long;
typedef pair<int, int> PII;
//#define int long long
const int N=1e5+5;
int d[N];
int dd[N];
vector<int> p[N];
queue<int> q;
bool vis[N];
void solve() {
    int n;
    cin>>n;
    for(int i=1;i<=n;i++) {
        int u,v;
        cin>>u>>v;
        d[u]++;
        d[v]++;
        p[u].push_back(v);
        p[v].push_back(u);
    }
    for(int i=1;i<=n;i++) {
        dd[i]=d[i];
        if(d[i]==1) {
            q.push(i);
            vis[i]=1;
        }
    }
    while(!q.empty()) {
        auto t=q.front();
        q.pop();
        for(auto it : p[t]) {
            d[it]--;
            if(d[it]==1&&!vis[it]) {
                q.push(it);
                vis[it]=1;
            }
        }
    }
    int ans=0,cnt=0;
    for(int i=1;i<=n;i++) {
        if(!vis[i]) {
            ans=max(dd[i],ans);
            cnt++;
        }
    }
    // cout<<cnt<<endl;
    if(ans==5) {
        cout<<2*(n-1);
    }
    else {
        cout<<1ll*(n-1)*cnt;
    }
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
    //std::cin>>T;
    while(T --) {
        solve();
    }
}