#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
const ll INF = 1ll << 60;
typedef pair<int, int> PI;
const int N = 1e5 + 10;
int t;
int n;
vector<int> a[N];
map<int, int> mp;
bool judge[N];
int cnt[6];
vector<int> h;
bool dfs(int g, int fa)
{
    for (int i = 0; i < a[g].size(); i++)
    {
        if (a[g][i] == fa)
            continue;

        if (judge[a[g][i]])
        {
            h.push_back(g);
            return true;
        }
        else
        {
            judge[a[g][i]] = 1;
            bool vis = dfs(a[g][i], g);
            if (vis)
            {
                h.push_back(g);
                return true;
            }
        }
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        int x, y;
        cin >> x >> y;
        a[x].push_back(y);
        a[y].push_back(x);
        mp[x]++;
        mp[y]++;
    }
    judge[1] = 1;
    dfs(1, -1);
    for (auto it : mp)
    {
        cnt[it.second]++;
    }
    if (cnt[5] == 2)
    {
        cout << n - cnt[5] - cnt[4] << endl;
    }
    else if (cnt[5] == 1)
    {
        cout << 2 * (n - cnt[5] - cnt[4]) << endl;
    }
    else
    {
        ll ans = 0;
        for (int i = 1; i < h.size(); i++)
        {
            if (mp[h[i]] < 4)
            {
                ans += (n - cnt[4]);
                if (mp[h[i - 1]] == 4)
                {
                    ans++;
                }
            }
            else
            {
                ans += (n - cnt[4] + 1);
                if (mp[h[i - 1]] == 4)
                {
                    ans++;
                }
            }
            if (n == h.size() - 1)
            {
                if (mp[h[i]] < 4)
                {
                    ans += (n - cnt[4]);
                    if (mp[h[0]] == 4)
                    {
                        ans++;
                    }
                }
                else
                {
                    ans += (n - cnt[4] + 1);
                    if (mp[h[0]] == 4)
                    {
                        ans++;
                    }
                }
            }
        }
        cout << ans << endl;
    }
    return 0;
}