#include<bits/stdc++.h>

using namespace std;

int n,ans;
pair<string,string> p[10005];
unordered_map<string,int> mp1,mp2;

int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		cin>>p[i].first;
		for(int j=1;j<=3;j++)
			cin>>p[i].second;
	}
	for(int i=1;i<=n;i++)
	{
		mp1[p[i].first]++;
		mp2[p[i].second]++;
	}
	for(int i=1;i<=n;i++)
	{
		if(mp1[p[i].first]>=2&&mp1[p[i].second]>=2&&mp2[p[i].first]>=1)
		{
			ans+=(mp1[p[i].first]==2? 1:mp1[p[i].first]*(mp1[p[i].first]-1)/2)*(mp1[p[i].second]==2? 1:mp1[p[i].second]*(mp1[p[i].second]-1)/2)*(mp2[p[i].first]==1? 1:mp2[p[i].first]*(mp2[p[i].first]-1)/2);
		}
	}
	printf("%d",ans);
	return 0;
}