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

const int N = 1e5 + 10;

int n;
vector<vector<int>> adj;
int fa[N], deg[N];
vector<int> path, pre;

int get(int x) {
    if (x == fa[x]) {
        return x;
    }
    return fa[x] = get(fa[x]);
}

void dfs(int x, int y) {
    if (x == y) {
        int cur = x;
        while (cur != -1) {
            path.push_back(cur);
            cur = pre[cur];
        }
        return;
    }
    for (auto v : adj[x]) {
        if (pre[v] == 0) {
            pre[v] = x;
            dfs(v, y);
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    #ifndef ONLINE_JUDGE
    freopen("in.in", "r", stdin);
    #endif

    cin >> n;
    adj.resize(n);
    pre.resize(n);
    iota(fa, fa + N, 0);

    for (int i = 0; i < n; i++) {
        int x, y;
        cin >> x >> y;
        x--, y--;
        deg[x]++, deg[y]++;
        if (get(x) != get(y)) {
            adj[x].push_back(y);
            adj[y].push_back(x);
            fa[get(x)] = get(y);
        } else pre[x] = -1, dfs(x, y);
    }

    int d4 = 0, dg4 = 0;
    for (int i = 0; i < n; i++) {
        if (deg[i] == 4) d4++;
        else if (deg[i] > 4) dg4++;
    }

    ll ans = 0;
    int len = path.size();
    // cout << len;

    for (int i = 0; i < (int)path.size(); i++) {
        int u = path[i], v = path[(i + 1) % len];
        if (deg[u] == 4) d4--;
        else if (deg[u] > 4) dg4--;
        if (deg[v] == 4) d4--;
        else if (deg[v] > 4) dg4--;
        deg[u]--, deg[v]--;
        if (deg[u] == 4) d4++;
        else if (deg[u] > 4) dg4++;
        if (deg[v] == 4) d4++;
        else if (deg[v] > 4) dg4++;

        if (dg4 == 0) ans += n - d4;

        if (deg[u] == 4) d4--;
        else if (deg[u] > 4) dg4--;
        if (deg[v] == 4) d4--;
        else if (deg[v] > 4) dg4--;
        deg[u]++, deg[v]++;
        if (deg[u] == 4) d4++;
        else if (deg[u] > 4) dg4++;
        if (deg[v] == 4) d4++;
        else if (deg[v] > 4) dg4++;
    }


    cout << ans;


    return 0;
}
/*
6
 1 2
 1 3
 1 4
 1 5
 1 6
 2 3
*/