#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0) 
#define setbit0(n, i) ((n) & (~(1LL << (i)))) 
#define setbit1(n, i) ((n) | (1LL << (i))) 
#define togglebit(n, i) ((n) ^ (1LL << (i))) 
#define lastone(n) ((n) & (-(n))) 
char gap = 32;
#define int long long
#define ll long long 
#define lll __int128_t
#define pb push_back
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll hashPrime = 1610612741;

const int M = 10;
vector<vector<bitset<M>>> calc(vector<int> arr) {
    bitset<M> fre[2][10];
    for(int i = 0; i < arr.size(); i++) {
        fre[0][arr[i] % 10][i] = 1;
        fre[1][arr[i] / 10][i] = 1;
    }
    vector<vector<bitset<M>>> res(100, vector<bitset<M>>(100, 0));
    for(int i = 11; i <= 99; i++) {
        if(i % 10 == 0) continue;
        for(int j = 11; j <= 99; j++) {
            if(j % 10 == 0) continue;

            int a = i / 10, b = i % 10;
            int e = j / 10, f = j % 10;

            if(a == e) {
                res[i][j] |= (fre[1][a]);
            }
            else {
                for(int k = 1; k <= 9; k++) {
                    if(k == a or k == e) continue;
                    res[i][j] |= (fre[1][k]);
                }
            }
            if(b == f) {
                res[i][j] &= (fre[0][b]);
            }
            else {
                bitset<M> tmp = 0;
                for(int k = 1; k <= 9; k++) {
                    if(k == b or k == f) continue;
                    tmp |= (fre[0][k]);
                }
                res[i][j] &= tmp;
            }
        }
    }
    return res;
}

void solve() {
    int n; cin >> n;
    vector<int> a(n);
    vector<int> fp, sp;
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        fp.push_back(a[i] / 100);
        sp.push_back(a[i] % 100);
    }
    auto fcalc = calc(fp);
    auto scalc = calc(sp); 
    bitset<M> x;
    int ans = 0;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            if(i == j) continue;
            x = (fcalc[fp[i]][fp[j]] & scalc[sp[i]][sp[j]]);
            //cout << x.to_string() << "\n";
            x[i] = 0;
            x[j] = 0;
            ans += x.count();
        }
    }
    //cout << ans << "\n";
    cout << ans / 6 << "\n";
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    solve();
    return 0;
}