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

#define endl '\n'


int n;
string s[2005];
bitset<2005> a[2005][20];

void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> s[i];
    }
    for (int i = 1; i <= n; i++)
        for (int j = i + 1; j <= n; j++) {
            int zt = 0;
            for (int k = 0; k <= 3; k++)
                if (s[i][k] == s[i][k])
                    zt |= 1 << k;
            a[i][zt][j] = 1;
        }
    int ans = 0;
    for (int i = 1; i <= n; i++)
        for (int j = i + 1; j <= n; j++) {
            int zt = 0;
            for (int k = 0; k <= 3; k++)
                if (s[i][k] == s[i][k])
                    zt |= 1 << k;
            ans += (a[i][zt] & a[j][zt]).count();
        }
    cout << ans << endl;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
//    cin >> T;
    while (T--) {
        solve();
    }

    return 0;
}