#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    //1:1, 10:10, 100:100, 1000~:40
    ll N, sm=0;
    set<ll> st;
    vector<ll> cnt(10);
    string S;
    cin >> N >> S;
    for (int i=0; i<N; i++){
        cnt[S[i]-'0']++;
        sm += S[i]-'0';
    }
    if (N == 1){
        cout << 1 << endl;
        return 0;
    }
    if (N == 2){
        cout << (S[0] == S[1] ? 1 : 2) << endl;
        return 0;
    }
    for (int i=1; i<10; i++){
        for (int j=1; j<10; j++){
            for (int k=1; k<10; k++){
                bool f=1;
                cnt[i]--;
                cnt[j]--;
                cnt[k]--;
                if (cnt[i] < 0 || cnt[j] < 0 || cnt[k] < 0) f=0;
                cnt[i]++;
                cnt[j]++;
                cnt[k]++;
                if (f) st.insert(((sm-i-j-k)*40+i+j*10+k*100) % 120);
            }
        }
    }

    cout << st.size() << endl;

    return 0;
}