#include<bits/stdc++.h>
#define PII pair<int,int>
#define x first
#define y second
using namespace std;

const int N = 1e5 + 10;

int n;
bitset<N> vis;
vector<int> a[N];
vector<int> ci,stp;


void dfs(int lp,int p)
{
    for(auto &i : a[p])
    {
        if(i == lp) continue;
        if(vis[i])
        {
            ci = stp;
            return ;
        }
        vis[i] = true;
        stp.push_back(i);
        dfs(p,i);
        vis[i] = false;
        stp.pop_back();
    }

}

signed main(void)
{
    cin.tie(0), cout.tie(0), ios::sync_with_stdio(false);
    cin >> n;
    int ans = 0;
    for(int i=1;i<=n;++i)
    {
        int x,y;    cin >> x >> y;
        a[x].push_back(y), a[y].push_back(x);
    }
    dfs(0,1);
    int p=0;
    for(int i=1;i<=n;++i)   if(a[i].size() >= a[p].size())    p = i;
    //for(auto &i : ci)   cout << i << ' ';
    if(a[p].size() == 5)    ans = (n-1)*2;
    else
    {
        //stp = ci;
        stp.clear();
        for(int i=1;i<=n;++i)   if(a[i].size() >= 4) stp.push_back(i);
        sort(ci.begin(),ci.end());
        for(auto &i : stp)
        {
            if(lower_bound(ci.begin(),ci.end(),i) != ci.end())  ans += 2;
            //cout << i << ' ';
        }
        //puts("");
        //cout << ans << ' ' << stp.size() << '\n';
        ans += (n-stp.size())*ci.size();
    }
    cout <<ans <<'\n';


    return 0;
}