#include <bits/stdc++.h>
using namespace std;
int n, ans = 0;
string s[10005][5];
string t1, t2, t3, t4;
bool vis[10005] = {0};
bool find(int v, string key1, string key2) {
	return (s[v][1] == key1 && s[v][4] == key2);
}

void dfs(int p, string key) {
	//cout << p << " ";
	if(p <= 3)
		for(int i = 1;i <= n;i++)
			if(s[i][1] == key && !vis[i]) {
				if(p == 1) t1 = s[i][1], t4 = s[i][4];
				else if(p == 2) t2 = s[i][4];
				else if(p == 3) t3 = s[i][4];
				vis[i] = 1;
				dfs(p + 1, s[i][4]);
				vis[i] = 0;
			}
	else if(p == 4) for(int i = 1;i <= n;i++) if(find(i, key, t1) && !vis[i]) { vis[i] = 1; dfs(p + 1, s[i][4]); vis[i] = 0; }
	else if(p == 5) for(int i = 1;i <= n;i++) if(find(i, key, t2) && !vis[i]) { vis[i] = 1; dfs(p + 1, t4); vis[i] = 0; }
	else { for(int i = 1;i <= n;i++) { if(find(i, key, t3) && !vis[i]) ans++; } return; } 
}

signed main() {
	freopen("p4.in", "r", stdin);
	freopen("p4.out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin >> n;
	for(int i = 1;i <= n;i++) for(int j = 1;j <= 4;j++) cin >> s[i][j];
	//for(int i = 1;i <= n;i++) for(int j = 1;j <= 4;j++) cout << s[i][j] << " ";
	for(int i = 1;i <= n;i++) { vis[i] = 1; dfs(1, s[i][1]); vis[i] = 0; }
	cout << ans << endl;
	return 0;
}
//¸øÎÒAC£¡¸øÎÒAC£¡£¡¸øÎÒAC£¡£¡£¡