#include // mod 3: constant // mod 5: determined only by the lowest one digit // mod 8: determined only by the lowest three digits int main() { int n; std::scanf("%d", &n); char s[200000]{}; std::scanf("%s", s); int cnt[10]{}, flg[40]{}; for (int i = 0; i < n; ++i) ++cnt[s[i] - '0']; for (int x = 1; x <= 9; ++x) { --cnt[x]; for (int y = 1; y <= 9; ++y) { if (n <= 1) y = 0; else --cnt[y]; for (int z = 1; z <= 9; ++z) { if (n <= 2) z = 0; else --cnt[z]; if (cnt[x] >= 0 and cnt[y] >= 0 and cnt[z] >= 0) { int mod8 = (100 * z + 10 * y + x) % 8; int mod5 = x % 5; flg[mod8 * 5 + mod5] = 1; } if (n <= 2) break; else ++cnt[z]; } if (n <= 1) break; else ++cnt[y]; } ++cnt[x]; } int ans = 0; for (int v = 0; v < 40; ++v) ans += flg[v]; std::printf("%d\n", ans); }