import sys
from itertools import permutations
from heapq import heappop,heappush
from collections import deque
import random
import bisect

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

def solve_brute(N,S):
    L = permutations([i for i in range(N)])
    res = set()
    for p in L:
        tmp = int("".join([S[p[i]] for i in range(N)]))
        res.add(tmp % 120)
    return len(res)

def solve(N,S):
    if N <= 4:
        L = permutations([i for i in range(N)])
        res = set()
        for p in L:
            tmp = int("".join([S[p[i]] for i in range(N)]))
            res.add(tmp % 120)
        return len(res)


    cnt = [0] * 10
    for s in S:
        cnt[int(s)] += 1


    res = set()
    for r in range(100,1000):
        d = []
        for _ in range(3):
            d.append(r % 10)
            r //= 10
        if 0 in d:
            continue

        flg = 1
        for x in range(1,10):
            if d.count(x) > cnt[x]:
                flg = 0
        if flg:
            r = 100 * d[2] + 10 * d[1] + d[0]
            res.add(r % 40)
    return len(res)

N = int(input())
S = input()
print(solve(N,S))