#include <cstdio>
#include <vector>
#include <stack>
#include <iostream>

#define ll long long

using namespace std;

const int maxn = 1e5 + 7;

ll n;

vector<int> G[maxn], on_cycle;
bool vis[maxn];
stack<int> st;

bool dfs(int now, int prev)
{
    if (vis[now])
    {
        // printf("her %d\n", now);
        while (st.top() != now)
        {
            // printf("top %d\n", st.top());
            on_cycle.push_back(st.top());
            st.pop();
        }
        on_cycle.push_back(st.top());
        return 1;
    }
    st.push(now);
    vis[now] = 1;
    for (int i = 0; i < G[now].size(); ++i)
    {
        int to = G[now][i];
        if (to == prev) continue;
        // st.push(to);
        if (dfs(to, now)) return 1;
        // st.pop();
    }
    if (!st.empty())
        st.pop();
    return 0;
}


int main()
{
    scanf("%lld", &n);
    int x, y;
    for (int i = 0; i < n; ++i)
    {
        scanf("%d %d", &x, &y);
        G[x].push_back(y);
        G[y].push_back(x);
    }
    dfs(1, 1);
    // for (int i = 0; i < on_cycle.size(); ++i)
    //     printf("%d ", on_cycle[i]);
    int pt = 0;
    for (int i = 1; i <= n; ++i)
        if (G[i].size() > 4) pt = i;
    int cnt = 0;
    if (pt)
    {
        // cout << pt <<endl;
        for (int i = 0; i < G[pt].size(); ++i)
        {
            int to = G[pt][i];
            bool on = 0;
            // printf("x%dx", to);
            for (int j = 0; j < on_cycle.size(); ++j)
            {
                
                if (to == on_cycle[j])
                {
                    on = 1;
                    break;
                }
            }
            if (on) ++cnt;
        }
        printf("%lld\n", (ll)cnt * (n - 1));
    }
    else
    {
        printf("%lld\n", n * (on_cycle.size() - 1));
    }
    return 0;
}