#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;
    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;
                vector<int> vec = {i,j,k};
                do {
                    int n = vec[0]*100+vec[1]*10+vec[2];
                    st.insert(n%40);
                } while(next_permutation(vec.begin(),vec.end()));
            }
        }
    }
    cout << st.size() << endl;
    // cout << "st:" << endl;
    // for(int v : st) cout << v << endl;
    

}