#include<bits/stdc++.h>
using namespace std;
#define int long long

void solve() {
	int n;
	cin >> n;
	vector<vector<int>> e(n + 1);
	vector<int>in(n + 1), u(n + 1), v(n + 1);
	for(int i = 1; i <= n; i++) {
		cin >> u[i] >> v[i];
		in[u[i]]++;
		in[v[i]]++;
		e[u[i]].push_back(v[i]);
		e[v[i]].push_back(u[i]);
	}
	auto inn = in;
	auto toposort = [&]() {
		queue<int> q;
		for(int i = 1; i <= n; i++) {
			if(in[i] == 1)q.push(i);
		}
		while(q.size()) {
			int u = q.front();
			q.pop();
			for(int v: e[u]) {
				if(in[v] > 1) {//in[v] >= 2 的点即为环上的点
					in[v]--;
					if(in[v] == 1)q.push(v);
				}
			}
		}
	};
	vector<int> cnt(n + 1, 0);
	for(int i = 1; i <= n; i++) {
		cnt[inn[i]] += 1;
	}
	toposort();
	int ans = 0;
	vector<array<int, 2>> res;
	for(int i = 1; i <= n; i++) {
		if(in[u[i]] >= 2 && in[v[i]] >= 2) { //环边
			res.push_back({u[i], v[i]});
		}
	}
	for(auto [u, v]: res) {
		cnt[inn[u]]--;
		cnt[inn[v]]--;
		cnt[inn[u] - 1]++;
		cnt[inn[v] - 1]++;
		if(cnt[5]) {
			cnt[inn[u]]++;
			cnt[inn[v]]++;
			cnt[inn[u] - 1]--;
			cnt[inn[v] - 1]--;
			continue;
		}
		ans += cnt[1] + cnt[2] + cnt[3];
		cnt[inn[u]]++;
		cnt[inn[v]]++;
		cnt[inn[u] - 1]--;
		cnt[inn[v] - 1]--;
	}
	cout << ans << endl;
}

#undef int
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t = 1;
	// cin >> t;
	while(t--) {
		solve();
	}
	return 0;
}