#include<bits/stdc++.h>
using namespace std;
int n, cnt[15],dp[105][20];
long long ans;
char s[105];
int num(char a){
    if(a=='A') return 1;
    else if(a=='T'||a=='J'||a=='Q'||a=='K') return 10;
    else return a-'0';
}
void fif(){
    dp[0][0]=1;
    for(int i=1;i<=n;i++){
        for(int j=15;j>=num(s[i]);j--){
            dp[i][j]+=dp[i-1][j-num(s[i])];
        }
        for(int j=15;j>=0;j--) dp[i][j] += dp[i-1][j];
    }
    ans += 2 * dp[n][15];
}
int num1(char a){
    if(a=='A') return 1;
    else if(a=='T') return 10;
    else if(a=='J') return 11;
    else if(a=='Q') return 12;
    else if(a=='K') return 13;
    else return a-'0';
}
void pairs(){
    long long tmp=0;
    for(int i=1;i<=n;i++) cnt[num1(s[i])]++;
    for(int i=1;i<=13;i++) if(cnt[i]) tmp += cnt[i]*(cnt[i]-1);
    ans+= tmp;
}
void runs(){
    int curr=1; long long tmp=0,tmp1=0,tmp2=0;
    while(curr <= 13){
        if(cnt[curr] == 0){if(tmp2>=3) tmp += tmp1*tmp2; tmp1=0; tmp2=0;}
        else{
            if(tmp1==0) tmp1=cnt[curr],tmp2=1;
            else tmp1*=cnt[curr],tmp2++;
        }
        curr++;
    }
    if(tmp2>=3) tmp+=tmp1*tmp2; ans+=tmp;
}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++) cin>>s[i];
    fif();
    pairs(); runs();
    cout<<ans;
    return 0;
}