#include <bits/stdc++.h>

using namespace std;
#define int long long
#define endl '\n'
const int N = 2e3 + 5;
int n, a[N][5], jc[N], cnt[N][20];
int C(int n, int k)
{
    return jc[n] / jc[k] / jc[n - k];
}
void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        string s;
        cin >> s;
        for (int j = 1; j <= 4; j++)
            a[i][j] = s[j] - '0';
    }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            if (i != j)
            {
                int st = 0;
                for (int k = 1; k <= 4; k++)
                    if (a[i][k] == a[j][k])
                        st |= 1 << (k - 1);
                cnt[i][st]++;
            }
    int ans = 0;
    for (int i = 1; i <= n; i++)
        for (int j = i + 1; j <= n; j++)
        {
            int zt = 0;
            for (int k = 1; k <= 4; k++)
                if (a[i][k] == a[j][k])
                    zt |= 1 << (k - 1);
            ans += cnt[i][zt] - 1;
            int tot = __builtin_popcount(15 ^ zt);
            for (int st = zt + 1; st < 16; st++)
                if ((st & zt) == zt)
                {
                    int js = __builtin_popcount(st ^ zt);
                    ans -= cnt[j][st];
                }
        }
    cout << ans / 3 << endl;
}

signed main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    // cin>>t;
    jc[0] = 1;
    for (int i = 1; i <= 10; i++)
        jc[i] = i * jc[i - 1];
    while (t--)
        solve();
    return 0;
}