#include<bits/stdc++.h>
using namespace std;
using ll=long long;


int main(){

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll N;
    cin>>N;
    vector<vector<ll>> G(N);
    vector<int> E(N);
    for(int i=0;i<N;i++){
        int u,v;
        cin>>u>>v;
        u--;v--;
        G[u].push_back(v);
        G[v].push_back(u);
        E[u]++;
        E[v]++;
    }
    vector<int> P=E;
    vector<bool> LOOP(N,1);
    queue<int> Q;
    for(int i=0;i<N;i++){
        if(P[i]==1){
            Q.push(i);
        }
    }
    while(!Q.empty()){
        int p=Q.front();
        Q.pop();
        if(!LOOP[p])continue;
        LOOP[p]=0;
        for(int v:G[p]){
            P[v]--;
            if(P[v]==1){
                Q.push(v);
            }
        }
    }
    vector<int> CNT(N+1,0);
    for(int i=0;i<N;i++)CNT[E[i]]++;
    set<pair<int,int>> seen;
    ll an=0;
    for(int i=0;i<N;i++){
        if(!LOOP[i])continue;
        int u=i;
        for(auto j:G[i]){
            if(LOOP[j]){
                int v=j;
                if(u>v)swap(u,v);
                if(seen.count({u,v}))continue;
                seen.insert({u,v});
                CNT[E[u]]--;
                CNT[E[v]]--;
                CNT[E[u]-1]++;
                CNT[E[v]-1]++;
                an+=N-CNT[4];
                CNT[E[u]]++;
                CNT[E[v]]++;
                CNT[E[u]-1]--;
                CNT[E[v]-1]--;
            }
        }
    }
    cout<<an<<endl;
}