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

#define int long long

string a[111], b, c, d[111];
int n;
bool vis[111];
int q[15], top = 0, ans = 0;

void dfs(int p){
	if(top == 4){
		if(d[q[4]] == a[q[1]]){
			bool f1 = 0, f2 = 0;
			for(int i = 1;i <= n;i++){
				if(a[i] == d[q[2]] && d[i] == a[q[4]]) f1 = 1;
				else if(a[i] == d[q[1]] && d[i] == a[q[3]]) f2 = 1;
			}
			if(f1 && f2) ans++;
		}
	}
	for(int i = 1;i <= n;i++){
		if(vis[i]) continue;
		if(a[i] == d[p]){
			q[++top] = i;
			vis[i] = 1;
			dfs(i);
//			vis[i] = 0;
			top--;
		}
	} 
	return ;
}

signed main(){
	cin >> n;
	for(int i = 1;i <= n;i++){
		cin >> a[i] >> b >> c >> d[i];
	}
	for(int i = 1;i <= n;i++){
		dfs(i);
	}
	cout << ans << "\n";
	return 0;
}