#include <bits/stdc++.h>
using namespace std;
template <typename T> using min_priority_queue = priority_queue<T,vector<T>,greater<T>>;

template<typename T>
void printv(vector<T> &v){
    bool b = false;
    for(auto i : v){
        if(b) cout << " ";
        else b = true;
        cout << i;
    }
    cout << endl;
}

int64_t rand64(){
    int64_t l = rand();
    int64_t r = rand();
    return (l<<31)+r;
}

template <typename T>
bool chmin(T &a, const T& b) {
    if (a > b) {
        a = b;  // aをbで更新
        return true;
    }
    return false;
}

template <typename T>
bool chmax(T &a, const T& b) {
    if (a < b) {
        a = b;  // aをbで更新
        return true;
    }
    return false;
}

bool yn(bool b){
    if(b) cout << "Yes" << endl;
    else cout << "No" << endl;
    return b;
}

bool debug;
bool randomInput;
bool debugOutput;
int numOfTestCase;

using ans_type = int;
int N;
string S;

void input(){
    if(numOfTestCase > 1){
        S.clear();
    }

    if(randomInput){
        N = rand()%9+1;
        for(int i = 0; i < N; i++){
            S.push_back('0' + rand()%9 + 1);
        }
    }
    else{
        cin >> N >> S;
    }
    return;
}

void output_input(){
    cout << S << endl;
}

ans_type calc_simple();

ans_type calc(){
    if(N < 3) return calc_simple();
    vector<int> B(10, 0);
    for(char c : S){
        int x = c - '0';
        B[x]++;
    }

    vector<bool> mod40(40, false);
    for(int i = 0; i < 1000; i++){
        string s = to_string(1000 + i).substr(1);
        vector<int> C(10, 0);
        for(char c : s) C[c - '0']++;

        bool bl = true;
        for(int j = 0; j < 10; j++){
            if(B[j] < C[j]){
                bl = false;
                break;
            }
        }
        if(bl == true) mod40[i%40] = true;
    }

    int ans = 0;
    for(auto b : mod40) if(b) ans++;
    return ans;
}

ans_type calc_simple(){
    string t = S;
    sort(t.begin(), t.end());
    //cout << t << endl;
    vector<int> mod40(40, 0);
    do{
        int64_t i = stoll(t);
        mod40[i%40]++;
        //cout << t << " " << i << " " << i%40 << endl;
    }while(next_permutation(t.begin(), t.end()));

    int ans = 0;
    for(int i : mod40) if(i) ans++;

    return ans;
}

void output(ans_type ans){
    cout << ans << endl;
    return;
}

int main(){
    debug = 0;
    randomInput = 0;
    debugOutput = 0;
    numOfTestCase = 1;
    srand(time(NULL));
    cout << fixed << setprecision(12);
    
    if(numOfTestCase == 0) cin >> numOfTestCase;

    if(debug){
        for(int i = 0; i < numOfTestCase; i++){
            if(debugOutput) cout << string(16, '-') << endl;
            input();
            ans_type ans = calc();
            ans_type ansSimple = calc_simple();
            if(ans != ansSimple){
                output_input();
                output(ans);
                output(ansSimple);
                cout << endl;
            }
        }
    }
    else{
        for(int i = 0; i < numOfTestCase; i++){
            input();
            output(calc());
        }
    }

    return 0;
}