#include<bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 2000 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int n;
string s[maxN];
int f[maxN][10000];
vector<int> val;
int pw[4] = {1, 10, 100, 1000};
void ReadInput()
{
    cin >> n;
    for(int i=1; i<=n; i++)
    {
        cin >> s[i];
        val.pb(stoi(s[i]));
    }
    sort(val.begin(), val.end());
    val.erase(unique(val.begin(), val.end()), val.end());
    for(int i=n; i>=1; i--)
    {
        for(int j=0; j<10000; j++)
        {
            bool ok = true;
            string cur = to_string(j);
            while(cur.size() < 4) cur = '0' + cur;
            for(int t=0; t<4; t++)
            {
                if(cur[t] == '0') continue;
                if(s[i][t] != cur[t])
                {
                    ok = false;
                    break;
                }
            }
            f[i][j] = f[i + 1][j] + ok;
        }
    }

}
int chk(char a, char b)
{
    if(a == b) return a - '0';
    return -1;
}
int get(int x, int i)
{
    return x % (pw[i] * 10) / pw[i] * pw[i];
}
void Solve()
{
    int res = 0;
    for(int i=1; i<=n; i++)
        for(int j=i+1; j<n; j++)
        {
            int val = 0;
            vector<int> pos;
            for(int t=0; t<4; t++)
            {
                if(chk(s[i][t], s[j][t]) == -1)
                {
                    val = val * 10;
                    pos.pb(t);
                }
                else val = val * 10 + (s[i][t] - '0');
            }

            int sum = f[j + 1][val];
            vector<int> vc;
            vc.pb(0);
            for(int t=0; t<pos.size(); t++)
            {
                vector<int> tmp;
                for(int v : vc)
                {
                    tmp.pb(v + (s[i][pos[t]] - '0') * pw[3 - pos[t]]);
                    tmp.pb(v + (s[j][pos[t]] - '0') * pw[3 - pos[t]]);
                }
                swap(vc, tmp);
            }
            for(int mask=1; mask<(1<<(pos.size())); mask++)
            {
                vector<int> tmp;
                for(int t=0; t<pos.size(); t++)
                {
                    if(!(mask >> t & 1))
                    {
                        for(int &v : vc)
                            tmp.pb(v - get(v, pos[t]));
                    }
                }
                for(int v : tmp)
                {
                    //cout << v << '\n';
                }
                sort(tmp.begin(), tmp.end());
                tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());
                if(__builtin_popcount(mask) & 1)
                {
                    for(int v : tmp)
                    {
                        sum -= f[j + 1][val + v];
                    }

                }
                else
                {
                    for(int v : tmp)
                        sum += f[j + 1][val + v];
                }
            }
            res += sum;

        }
    cout << res;
}
#define taskname "sol"
int32_t main()
{
    if (fopen(taskname ".inp", "r"))
    {
        freopen(taskname ".inp", "r", stdin);
        //  freopen(taskname ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    //cin >> T;
    for(int itest=1; itest<=T; itest++)
    {
        ReadInput();
        Solve();
    }
}