#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define sp ' '
#define endl '\n'
#define loop(i, l, r) for(int i=(int)(l); i<=(int)(r); i++)
#define rloop(i,l,r) for(int i=(int)(l); i>=(int)r; i--)
#define all(x) (x).begin(), (x).end()
#define bit(x,y) ((x>>y)&1)

using Arr = array<int,4>;

ostream& operator<<(ostream &os, Arr x){
    os << "[";
    loop(i,0,3) os << x[i] << sp;
    os << "]";
    return os;
}

const int STAR = 0;
const int N = 4477456;
int n;
vector<int> a;
int maxCode = 10; // 0->9
int code[10][10];

int f[N]; // 46^4

Arr conv3(int x){
    Arr ret;
    rloop(i,3,0){
        ret[i] = x%3;
        x/=3;
    }
    return ret;
}

Arr conv(int x){
    Arr ret;
    rloop(i,3,0){
        ret[i] = x%10;
        x/=10;
    }
//    cout << x << sp << ret << endl;
    return ret;
}

int encode(const Arr& fx){
    int ret = 0;
    loop(i,0,3){
        ret*=maxCode;
        ret+=fx[i];
    }
//    if (ret>=N){
//        loop(i,0,3) cout << fx[i] << sp;
//        cout << endl;
//        exit(0);
//    }
    return ret;
}

int calc(int x, int y){
    auto fx = conv(x);
    auto fy = conv(y);
    loop(i,0,3) if (fx[i]>fy[i]) swap(fx[i],fy[i]); // must be here

    int mustOn = 0;
    loop(i,0,3) if (fx[i]==fy[i]) mustOn^=(1<<i);

    int nStar = 4 - __builtin_popcount(mustOn);

    Arr enc;
    int ret = 0;
    loop(mask,0,(1<<4)-1){
        if ((mask&mustOn)!=mustOn) continue;

        int curStar = 0;
        loop(i,0,3){
            if (bit(mustOn,i)){
                enc[i] = fx[i];
            }
            else{
                if (bit(mask,i)) enc[i] = code[fx[i]][fy[i]];
                else {
                    enc[i] = STAR;
                    curStar++;
                }
            }
        }
        auto rec = f[encode(enc)];
//        cout << enc << sp << curStar << sp << nStar << sp << rec << endl;
        if (curStar%2==nStar%2) ret+= rec;
        else ret-=rec;
    }
    return ret;
}

void prep(){
    loop(i,1,9){
        loop(j,i+1,9){
            code[i][j] = maxCode++;
        }
    }
}

void back(int pos, const Arr& fx, const Arr& mask, Arr& enc){
    if (pos==4){
        f[encode(enc)]++;
        return;
    }
    if (mask[pos]==0){
        enc[pos] = fx[pos];
        back(pos+1,fx,mask,enc);
    }
    else if (mask[pos]==1){
        loop(i,1,9){
            if (i==fx[pos]) continue;
            auto [x,y] = minmax({i,fx[pos]});
            enc[pos] = code[x][y];
            back(pos+1,fx,mask,enc);
        }
    }
    else{
        enc[pos] = STAR;
        back(pos+1,fx,mask,enc);
    }
}

void addToSet(int x){
    Arr fx = conv(x);

    Arr enc;
    loop(_mask,0,80){
        back(0,fx,conv3(_mask),enc);
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
#ifdef LOCAL
    freopen("1test.inp","r",stdin);
#endif
    cin >> n;
    a.assign(n,0);
    for(auto &it:a) cin >> it;

    prep();
    for(auto it:a){
        addToSet(it);
    }

    long long ans = 0;
    loop(i,0,n-1){
        loop(j,i+1,n-1){
            ans+=calc(a[i],a[j]);
        }
    }
    cout << ans/3 << endl;
}