#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

using LL = __int128;
istream& operator>>(istream& is, LL& v)
{
    string s;
    is >> s;
    v = 0;
    for (int i = 0; i < (int)s.size(); i++) {
        if (isdigit(s[i])) { v = v * 10 + s[i] - '0'; }
    }
    if (s[0] == '-') { v *= -1; }
    return is;
}

ostream& operator<<(ostream& os, const LL& v)
{
    if (v == 0) { return (os << "0"); }
    LL num = v;
    if (v < 0) {
        os << '-';
        num = -num;
    }
    string s;
    for (; num > 0; num /= 10) { s.push_back((char)(num % 10) + '0'); }
    reverse(s.begin(), s.end());
    return (os << s);
}

LL C[101][101];

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    {
        for (int i = 0; i <= 100; ++i) {
            C[i][0] = C[i][i] = 1;
        }
        for (int i = 0; i <= 100; ++i) {
            for (int j = 1; j < i; ++j) {
                C[i][j] = C[i-1][j] + C[i-1][j-1];
            }
        }
    }
    int n; cin >> n;
    vector<int> cnt(14);
    for (int i = 0; i < n; ++i) {
        char c; cin >> c;
        if (c == 'A') cnt[1] += 1;
        else if (c == 'T') cnt[10] += 1;
        else if (c == 'J') cnt[11] += 1;
        else if (c == 'Q') cnt[12] += 1;
        else if (c == 'K') cnt[13] += 1;
        else cnt[c-'0'] += 1;
    }
    LL res = 0;
    for (int i = 1; i <= 13;) {
        if (cnt[i] == 0) {
            i += 1;
            continue;
        }
        ll c = 0;
        ll r = 1;
        while (i <= 13 and cnt[i] > 0) {
            r *= cnt[i]; c += 1; i += 1;
        }
        if (c > 2) res += c*r;
    }
    for (int i = 1; i <= 13; ++i) {
        if (cnt[i] >= 2) {
            res += C[cnt[i]][2]*2LL;
        }
    }
    vector<int> v(14);
    auto dfs = [&](auto dfs, int i, int sum) -> void {
        if (i == 14) {
            if (sum == 15) {
                LL r = 2;
                for (int j = 1; j <= 13; ++j) {
                    if (v[j]) {
                        r *= C[cnt[j]][v[j]];
                    }
                }
                res += r;
            }
            return;
        }
        int ad = i;
        if (i >= 10) ad = 10;
        for (int j = 0; j <= cnt[i] and sum+ad*j <= 15; ++j) {
            v[i] = j;
            dfs(dfs, i+1, sum+ad*j);
        }
    };
    dfs(dfs, 1, 0);
    cout << res << endl;
}