#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <math.h>
#include <cmath>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <iomanip>
#include <climits>
#include <functional>
#include <cassert>
#include <tuple>
using namespace std;
using ll = long long;

int N;
string S;

int main() {

    cin >> N >> S;
    if(N < 6) {
        vector<char> vec;
        for(int i = 0; i < N; ++i) vec.push_back(S[i]);
        sort(vec.begin(), vec.end());
        set<int> st;
        do {
            string s="";
            for(auto v : vec) s.push_back(v);
            st.insert(stoll(s)%120);
        } while(next_permutation(vec.begin(), vec.end()));
        cout << st.size() << endl;
    } else {
        vector<int> cnt(10);
        int sum = 0;
        for(int i = 0; i < N; ++i) {
            cnt[int(S[i]-'0')]++;
            sum += int(S[i]-'0');
        }

        set<int> st;
        for(int i = 1; i < 10; ++i) {
            for(int j = i; j < 10; ++j) {
                for(int k = j; k < 10; ++k) {
                    if(i == j && j == k && cnt[i] < 3) continue;
                    else if(i == j && cnt[i] < 2 || j == k && cnt[j] < 2) continue;
                    else if(cnt[i] < 1 || cnt[j] < 1 || cnt[k] < 1) continue;
                    int sum2 = sum-i-j-k;
                    vector<int> vec = {i,j,k};
                    do {
                        string s="";
                        for(auto v : vec) s.push_back(char(v+'0'));
                        ll num = stoll(s);
                        if(sum2%3 == 1) num += 1000;
                        if(sum2%3 == 2) num += 2000;
                        st.insert(num%120);
                    } while(next_permutation(vec.begin(),vec.end()));
                }
            }
        }
        cout << st.size() << endl;
        // cout << "st:" << endl;
        // for(int v : st) cout << v << endl;
    }

}