#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define xx first
#define yy second
#define endl "\n"
#define lowbit(x) x & (-x)
#define int long long
#define ull unsigned long long
#define pb push_back
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))
#define Ysanqian ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
const int N = 1e6 + 10, M = 1010, inf = 0x3f3f3f3f, mod = 18446, P = 13331;
const double eps = 1e-8;
int n, ans;
string s, p;
struct node
{
  string s, p;
} a[N];
bool check(node a, node b, node c)
{
  string s[3] = {a.s, b.s, c.s};
  string p[3] = {a.p, b.p, c.p};
  for (int i = 0; i <= 3; i++)
  {
    int num1 = 0, num2 = 0;
    if (i < 3)
      swap(s[i], p[i]);
    for (int j = 0; j < 5; j++)
    {
      if (s[0][j] = !s[1][j] && s[0][j] != s[2][j] && s[1][j] != s[2][j] && p[0][j] != p[1][j] && p[1][j] != p[2][j] && p[2][j] != p[0][j])
        return true;
      if (s[0][j] == s[1][j] == s[2][j])
        num1++;
      if (p[0][j] == p[1][j] == p[2][j])
        num2++;
    }
    if (i < 3)
      swap(s[i], p[i]);
    if (num1 <= 1 && num2 <= 1)
      return true;
  }
  return false;
}
void solve()
{
  cin >> n;
  for (int i = 1; i <= n; i++)
    cin >> a[i].s >> a[i].p;
  for (int i = 1; i <= n; i++)
    for (int j = i + 1; j <= n; j++)
      for (int k = j + 1; k <= n; k++)
        if (check(a[i], a[j], a[k]))
          ans++;
  cout << ans << endl;
}
signed main()
{
  Ysanqian;
  int T;
  T = 1;
  // cin >> T;
  while (T--)
    solve();
  return 0;
}