#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) A = -A, B = -B; return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) A = -A, B = -B; return divfloor(A + B - 1, B);}
ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
ll mul_limited(ll A, ll B, ll M = INF) { return B == 0 ? 0 : A > M / B ? M : A * B; }
ll pow_limited(ll A, ll B, ll M = INF) { if (A == 0 || A == 1) {return A;} ll res = 1; for (int i = 0; i < B; i++) {if (res > M / A) return M; res *= A;} return res;}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}
//*
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
//*/

int main()
{
  ll N;
  string S;
  cin >> N >> S;

  if (N <= 2)
  {
    set<ll> st;
    sort(S.begin(), S.end());
    do
    {
      st.insert(stoll(S) % 120);
    } while (next_permutation(S.begin(), S.end()));
    cout << st.size() << endl;
    return 0;
  }

  vector<ll> cnt(10, 0);
  for (auto c : S)
    cnt.at(c - '0')++;

  vector<bool> isok(40, false);
  for (ll a = 1; a < 10; a++)
  {
    for (ll b = 1; b < 10; b++)
    {
      for (ll c = 1; c < 10; c++)
      {
        vector<ll> use(10, 0);
        use.at(a)++, use.at(b)++, use.at(c)++;
        bool ok = true;
        for (ll i = 0; i < 10; i++)
        {
          if (use.at(i) > cnt.at(i))
            ok = false;
        }
        if (!ok)
          continue;
        
        isok.at((100 * a + 10 * b + c) % 40) = true;
      }
    }
  }
  ll ans = count(isok.begin(), isok.end(), true);
  cout << ans << endl;
}