#include<bits/stdc++.h>
using namespace std;
const int mod=233333;
int n,hash[mod+5];
char s1[15],s2[15];
long long ans;
vector<pair<int,int> > e[mod+5];
inline int zhuan(char a[],char b[]){
	return ((a[0]-'A')*26*26*26+(a[1]-'A')*26*26+(b[0]-'A')*26+(b[1]-'A'))%mod;
}
inline void insert(int x){
	bool f=0;
	for(int i=0;i<e[x].size();i++){
		if(e[x][i].first==x){
			e[x][i].second++;
			f=1;
			break;
		}
	}
	if(f==0){
		e[x].push_back(pair<int,int>(x,1));
	}
}
inline int find(int x){
	for(int i=0;i<e[x].size();i++){
		if(e[x][i].first==x){
			return e[x][i].second;
		}
	}
	return 0;
}
int main(){
	//freopen("test.in","r",stdin);
	//freopen("test.out","w",stdout); 
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>s1>>s2;
		 
		if(s1[0]!=s2[0]||s1[1]!=s2[1]){
			ans+=find(zhuan(s2,s1));
		}
		insert(zhuan(s1,s2));
	}
	cout<<ans;
	return 0;
}