#include<bits/stdc++.h>
using namespace std;
const int N = 4e4 + 10;
set <int> g[N];
int oknum[5];
bool f[N];
long long ans = 0;
map <string, int> m;
map <pair <int, int> , int> num; 
int cnt = 0;
bool ik(int a, int b) {
	return g[a].count(b);
}
void dfs(int now) {
	if(now == 5) {
		int a = oknum[1], b = oknum[2], c = oknum[3], d = oknum[4];
		if(ik(a, b) && ik(b, c) && ik(c, d) && ik(d, a) && ik(a, c) && ik(b, d)) {
			ans += num[make_pair(a, b)] * num[make_pair(b, c)] * num[make_pair(c, d)] * num[make_pair(d, a)] * num[make_pair(a, c)] * num[make_pair(b, d)];			
		}
		return;
	}
	for(int i = 1; i <= cnt; i++) {
		if(!f[i]) {
			f[i] = 1;
			oknum[now] = i;
			dfs(now + 1);
			f[i] = 0;
		}
	}
}

int main() {
	int n;
	cin >> n;
	for(int i = 1; i <= n; i++) {
		string a, b, c, d;
		cin >> a >> b >> c >> d;
		if(m[a] == 0) m[a] = ++cnt;
		if(m[d] == 0) m[d] = ++cnt;
		num[make_pair(m[a], m[d])]++;
		g[m[a]].insert(m[d]);
	}
	dfs(1);
	cout << ans;
	
	return 0;
}