#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


int N;
vector<int> A;
int F[13];


vector<Mint> dp;
// *= (1 + x^d + ... + x^(fd))
void update(int f, int d) {
  int len = dp.size();
  if (d) {
    len += f * d;
    dp.resize(len, 0);
    for (int x = len; --x >= (f + 1) * d; ) dp[x] -= dp[x - (f + 1) * d];
    for (int x = d; x < len; ++x) dp[x] += dp[x - d];
  } else {
    for (int x = 0; x < len; ++x) dp[x] *= (f + 1);
  }
}

// \sum (floor(sum/10) + 1)
Mint easy() {
  dp = {1};
  for (int a = 1; a <= 12; ++a) {
    update(F[a], a);
  }
  Mint ret = 0;
  for (int x = 0; x < (int)dp.size(); ++x) {
    ret += dp[x] * (x / 10 + 1);
  }
  return ret;
}


namespace slow {
constexpr int INF = 1001001001;
constexpr int LIM = 45;
int brt[LIM][LIM][LIM][LIM][10];
void build() {
  for (int f1 = 0; f1 < LIM; ++f1) for (int f11 = 0; f11 < LIM; ++f11) for (int f12 = 0; f12 < LIM; ++f12) {
    for (int x = 0; x < LIM; ++x) {
      fill(brt[f1][f11][f12][x], brt[f1][f11][f12][x] + 10, INF);
    }
  }
  brt[0][0][0][0][0] = 0;
  for (int f1 = 0; f1 < LIM; ++f1) for (int f11 = 0; f11 < LIM; ++f11) for (int f12 = 0; f12 < LIM; ++f12) {
    for (int x = 0; x < LIM; ++x) {
      for (int r = 0; r < 10; ++r) {
        if (f1 + 1 < LIM) chmin(brt[f1 + 1][f11][f12][x][(r + 1) % 10], brt[f1][f11][f12][x][r]);
        if (f11 + 1 < LIM) chmin(brt[f1][f11 + 1][f12][x][(r + 1) % 10], brt[f1][f11][f12][x][r] + ((r >= 9) ? 1 : 0));
        if (f12 + 1 < LIM) chmin(brt[f1][f11][f12 + 1][x][(r + 2) % 10], brt[f1][f11][f12][x][r] + ((r >= 8) ? 1 : 0));
        if (x + 1 < LIM) chmin(brt[f1][f11][f12][x + 1][max(r - 1, 0)], brt[f1][f11][f12][x][r]);
      }
    }
  }
}

Mint run() {
// build();
  Mint ans = 0;
  dp = {1};
  for (int a = 2; a <= 10; ++a) if (a % 2 == 0) update(F[a], 10 - a);
  const auto dpEven = dp;
  for (int a = 2; a <= 10; ++a) if (a % 2 != 0) update(F[a], 10 - a);
  for (int f1 = 0; f1 <= F[1]; ++f1) for (int f11 = 0; f11 <= F[11]; ++f11) for (int f12 = 0; f12 <= F[12]; ++f12) {
    int now = 0;
    int g1 = f1, g11 = f11, g12 = f12;
    for (; g11 + g12 > 0; ) {
      if (g12 && now <= 7) {
        --g12;
        now += 2;
      } else if (g11 && now <= 8) {
        --g11;
        now += 1;
      } else if (now == 9) {
        if (g1 < 1) break;
        g1 -= 1;
        now = 0;
      } else if (now == 8) {
        if (g1 < 2) break;
        g1 -= 2;
        now = 0;
      } else {
        assert(false);
      }
    }
    for (int x = 0; x < (int)dp.size(); ++x) {
      Mint ways[2];
      ways[0] = (x < (int)dpEven.size()) ? dpEven[x] : 0;
      ways[1] = dp[x] - ways[0];
      for (int od = 0; od < 2; ++od) {
        int safe = 9 - now + x;
        if (g1) {
          assert(!g11);
          if (now == 8 && od) {
            safe += 9;
          }
        }
        const int komaru = max(g11 * 1 + g12 * 2 - safe, 0);
        const int skip = (komaru + 9) / 10;
/*
if(x&&od){
 const int mn=*min_element(brt[f1][f11][f12][x],brt[f1][f11][f12][x]+10);
 if(mn!=skip){
  cerr<<f1<<" "<<f11<<" "<<f12<<"; "<<x<<"; "<<od<<": "<<mn<<" "<<skip<<endl;
  pv(brt[f1][f11][f12][x],brt[f1][f11][f12][x]+10);
 }
 assert(mn==skip);
}
*/
        ans += ways[od] * skip;
      }
    }
  }
cerr<<"ans = "<<ans<<endl;
  const Mint eas = easy();
  ans = eas - ans;
  return ans;
}
}  // slow


int main() {
  for (; ~scanf("%d", &N); ) {
    A.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d", &A[i]);
    }
    
    memset(F, 0, sizeof(F));
    for (int i = 0; i < N; ++i) {
      ++F[A[i]];
    }
cerr<<"F = ";pv(F,F+13);
    
    const Mint ans = slow::run();
    printf("%u\n", ans.x);
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}