#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++)
#define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 120;
#include<atcoder/all>
using namespace atcoder;
using mint = modint;
using vm = vector<mint>;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll n,to=0;string s;cin>>n>>s;
  if(n==1){cout<<1<<el;
  return 0;}
  mint::set_mod(MOD);
  vl C(9,0);
  for(auto c:s){C[c-'1']++;
  to+=c-'0';}
  if(n==2){
    ll cnt=0;
    rep(i,0,9){
      if(C[i]>0)cnt++;
    }
    cout<<cnt<<el;
    return 0;
  }
  set<int> st;
  REP(i,1,9)REP(j,1,9)REP(k,1,9){
    C[i-1]--;C[j-1]--;C[k-1]--;
    bool f=false;
    rep(l,0,9){
      if(C[l]<0){
        f=true;
      }
    }
    C[i-1]++;C[j-1]++;C[k-1]++;
    if(f)continue;
    mint stc=0;
    stc+=i+j*10+k*100+(to-i-j-k)*40;
    st.insert(stc.val());
  }
  cout<<st.size()<<el;
}