#include <bits/stdc++.h>
#define long long long int
#define DEBUG
using namespace std;
// @author: pashka
const int M = 10000000;
struct hashmap {
long keys[M];
int vals[M];
void clear() {
for (int i = 0; i < M; i++) vals[i] = 0;
}
int hash(long x) {
return (x * 239) % M;
}
int get(long x) {
int i = hash(x);
while (vals[i] != 0) {
if (keys[i] == x) return vals[i];
i++;
if (i == M) i = 0;
}
return 0;
}
void inc(long x) {
int i = hash(x);
while (vals[i] != 0) {
if (keys[i] == x) {
vals[i]++;
return;
}
i++;
if (i == M) i = 0;
}
keys[i] = x;
vals[i] = 1;
}
};
hashmap m1, m2;
long calc(vector<string> &a, vector<pair<int, int>> p) {
m1.clear();
m2.clear();
long res = 0;
for (int i = 0; i < (int) a.size(); i++) {
long s1 = 0, s2 = 0;
for (auto [x, y]: p) {
s1 *= 30;
s2 *= 30;
s1 += a[i][x] - 'A';
s2 += a[i][y] - 'A';
}
res += m2.get(s1);
res += m1.get(s2);
m1.inc(s1);
m2.inc(s2);
}
cerr << res << "\n";
return res;
}
char buf[10];
int main() {
ios::sync_with_stdio(false);
int n;
scanf("%d", &n);
vector<string> a(n);
for (int i = 0; i < n; i++) {
string x, y;
scanf("%s", buf);
x = buf;
scanf("%s", buf);
y = buf;
a[i] = x + y;
}
long res = 0;
res += calc(a, {{0, 2},
{1, 3}});
res += calc(a, {{0, 1},
{2, 3}});
res -= calc(a, {{0, 2},
{1, 3},
{2, 0},
{3, 1}}) / 2;
res -= calc(a, {{0, 1},
{2, 3},
{1, 0},
{3, 2}}) / 2;
res -= calc(a, {{0, 2},
{1, 3},
{1, 0},
{3, 2}});
res -= calc(a, {{0, 2},
{1, 3},
{0, 1},
{2, 3}});
vector<string> a3;
for (string s: a) {
if (s[0] == s[3] && s[1] == s[2]) a3.push_back(s);
}
res += calc(a3, {{0, 2},
{1, 3}}) / 2 * 3;
cout << res << "\n";
return 0;
}
