#include <iostream>
#include <numeric>
#include <algorithm>
#include <vector>

using namespace std;

using vi = vector<int>;

constexpr int Z = 40;

int main() {
    int n;
    cin >> n;
    int cnt[10] = {0};
    for (int i = 0; i < n; i++) {
        char c;
        cin >> c;
        cnt[c-'0']++;
    }

    vi d;
    for (int i = 0; i < 10; i++) {
        for (int j = 0; j < min(3, cnt[i]); j++) {
            d.push_back(i);
        }
    }

    bool f[Z] = {false};
    for (int i = 0; i < (int)d.size(); i++) {
        f[d[i]] = true;

        for (int j = 0; j < (int)d.size(); j++) {
            if (i == j) {
                continue;
            }

            f[(d[i]*10+d[j])%Z] = true;

            for (int k = 0; k < (int)d.size(); k++) {
                if (k != i && k != j) {
                    f[(d[i]*100+d[j]*10+d[k])%Z] = true;
                }
            }
        }
    }

    cout << accumulate(f, f + Z, 0) << endl;

    return 0;
}