import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const N = readInt; auto S = readToken; int[10] F; foreach (i; 0 .. N) { ++F[S[i] - '0']; } int[] ans; if (N == 1) { ans ~= (S[0] - '0'); } else if (N == 2) { ans ~= ((S[0] - '0') * 10 + (S[1] - '0')) % 40; ans ~= ((S[1] - '0') * 10 + (S[0] - '0')) % 40; } else { foreach (a; 0 .. 10) if (F[a]) { --F[a]; foreach (b; 0 .. 10) if (F[b]) { --F[b]; foreach (c; 0 .. 10) if (F[c]) { --F[c]; ans ~= (100*a + 10*b + c) % 40; ++F[c]; } ++F[b]; } ++F[a]; } } ans = ans.sort.uniq.array; debug { writeln("ans = ", ans); } writeln(ans.length); } } catch (EOFException e) { } }