#include <bits/stdc++.h>

using pii = std::pair<int, int>;
using ll = long long;

#define int long long

signed main()
{
    int n;
    std::cin >> n;
    // std::set<pii> s;
    std::vector<std::vector<int>> adj(n + 1);
    std::vector<pii> edg;
    std::vector<int> deg(n + 1), tmp;
    int cnt4 = 0;
    std::vector<int> ind;
    // bool flag = 0;
    for (int i = 0; i < n; ++i)
    {
        int l, r;
        std::cin >> l >> r;
        edg.emplace_back(l, r);
        // if (s.count({ l, r }) || s.count({ r, l }))
        // {
        //     flag = 1;
        // }
        adj[l].emplace_back(r);
        adj[r].emplace_back(l);
        ++deg[l], ++deg[r];
        if (deg[l] == 5) ind.emplace_back(l);
        if (deg[r] == 5) ind.emplace_back(r);
        if (deg[l] == 4) ++cnt4;
        if (deg[r] == 4) ++cnt4;
    }
    // if (flag)
    // {
    //     std::cout << n << "\n";
    //     return 0;
    // }
    tmp = deg;
    std::vector<bool> vis;
    std::queue<int> q;
    for (int i = 1; i <= n; ++i) if (tmp[i] == 1) q.emplace(i);
    while (q.size())
    {
        int u = q.front();
        q.pop();
        for (int to : adj[u])
        {
            --tmp[to];
            if (tmp[to] == 1) q.emplace(to);
        }
        tmp[u] = 0;
    }
    std::vector<bool> loop(n + 1);
    ll ans = 0;
    for (int i = 1; i <= n; ++i) if (tmp[i] != 0) loop[i] = 1;
    for (int j = 0; j < edg.size(); ++j)
    {
        auto [i, u] = edg[j];
        if (loop[i] && loop[u])
        {
            if (ind.size() == 1 && i != ind[0] && u != ind[0]) continue;
            if (ind.size() == 2)
                if (!(i == ind[0] && u == ind[1] || i == ind[1] && u == ind[0])) continue;
            // std::cout << cnt4 << "\n";
            if (deg[i] == 4) --cnt4;
            if (deg[u] == 4) --cnt4;
            --deg[i];
            --deg[u];
            ans += n - cnt4;
            ++deg[i];
            ++deg[u];
            if (deg[i] == 4) ++cnt4;
            if (deg[u] == 4) ++cnt4;
        }
    }
    std::cout << ans << "\n";

    return 0;
}