#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a >= b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll n;cin >> n;
    string s;cin >> s;
    if(n<=10){
        sort(all(s));
        set<ll> st;
        do{
            ll now=0;
            rep(i,n){
                now*=10;
                now+=s[i]-'0';
                now%=120;
            }
            st.insert(now);
        }while(next_permutation(all(s)));
        cout << st.size() << endl;
        return 0;
    }
    vl v(10);
    rep(i,n)v[s[i]-'0']++;
    set<ll> st;
    rep(i,1000){
        vl nv=v;
        ll x=i;
        if(nv[x%10]==0)continue;
        nv[x%10]--;
        x/=10;
        if(nv[x%10]==0)continue;
        nv[x%10]--;
        x/=10;
        if(nv[x%10]==0)continue;
        nv[x%10]--;
        x/=10;
        ll ans=0;
        rep(j,10)ans+=40*j*nv[j];
        ans+=i;
        st.insert(ans%120);
    }
    cout << st.size() << endl;
}