#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 = 998244353U;
constexpr unsigned MO2 = 2U * MO;
constexpr int FFT_MAX = 23;
using Mint = ModInt<MO>;
constexpr Mint FFT_ROOTS[FFT_MAX + 1] = {1U, 998244352U, 911660635U, 372528824U, 929031873U, 452798380U, 922799308U, 781712469U, 476477967U, 166035806U, 258648936U, 584193783U, 63912897U, 350007156U, 666702199U, 968855178U, 629671588U, 24514907U, 996173970U, 363395222U, 565042129U, 733596141U, 267099868U, 15311432U};
constexpr Mint INV_FFT_ROOTS[FFT_MAX + 1] = {1U, 998244352U, 86583718U, 509520358U, 337190230U, 87557064U, 609441965U, 135236158U, 304459705U, 685443576U, 381598368U, 335559352U, 129292727U, 358024708U, 814576206U, 708402881U, 283043518U, 3707709U, 121392023U, 704923114U, 950391366U, 428961804U, 382752275U, 469870224U};
constexpr Mint FFT_RATIOS[FFT_MAX] = {911660635U, 509520358U, 369330050U, 332049552U, 983190778U, 123842337U, 238493703U, 975955924U, 603855026U, 856644456U, 131300601U, 842657263U, 730768835U, 942482514U, 806263778U, 151565301U, 510815449U, 503497456U, 743006876U, 741047443U, 56250497U, 867605899U};
constexpr Mint INV_FFT_RATIOS[FFT_MAX] = {86583718U, 372528824U, 373294451U, 645684063U, 112220581U, 692852209U, 155456985U, 797128860U, 90816748U, 860285882U, 927414960U, 354738543U, 109331171U, 293255632U, 535113200U, 308540755U, 121186627U, 608385704U, 438932459U, 359477183U, 824071951U, 103369235U};

// as[rev(i)] <- \sum_j \zeta^(ij) as[j]
void fft(Mint *as, int n) {
  assert(!(n & (n - 1))); assert(1 <= n); assert(n <= 1 << FFT_MAX);
  int m = n;
  if (m >>= 1) {
    for (int i = 0; i < m; ++i) {
      const unsigned x = as[i + m].x;  // < MO
      as[i + m].x = as[i].x + MO - x;  // < 2 MO
      as[i].x += x;  // < 2 MO
    }
  }
  if (m >>= 1) {
    Mint prod = 1U;
    for (int h = 0, i0 = 0; i0 < n; i0 += (m << 1)) {
      for (int i = i0; i < i0 + m; ++i) {
        const unsigned x = (prod * as[i + m]).x;  // < MO
        as[i + m].x = as[i].x + MO - x;  // < 3 MO
        as[i].x += x;  // < 3 MO
      }
      prod *= FFT_RATIOS[__builtin_ctz(++h)];
    }
  }
  for (; m; ) {
    if (m >>= 1) {
      Mint prod = 1U;
      for (int h = 0, i0 = 0; i0 < n; i0 += (m << 1)) {
        for (int i = i0; i < i0 + m; ++i) {
          const unsigned x = (prod * as[i + m]).x;  // < MO
          as[i + m].x = as[i].x + MO - x;  // < 4 MO
          as[i].x += x;  // < 4 MO
        }
        prod *= FFT_RATIOS[__builtin_ctz(++h)];
      }
    }
    if (m >>= 1) {
      Mint prod = 1U;
      for (int h = 0, i0 = 0; i0 < n; i0 += (m << 1)) {
        for (int i = i0; i < i0 + m; ++i) {
          const unsigned x = (prod * as[i + m]).x;  // < MO
          as[i].x = (as[i].x >= MO2) ? (as[i].x - MO2) : as[i].x;  // < 2 MO
          as[i + m].x = as[i].x + MO - x;  // < 3 MO
          as[i].x += x;  // < 3 MO
        }
        prod *= FFT_RATIOS[__builtin_ctz(++h)];
      }
    }
  }
  for (int i = 0; i < n; ++i) {
    as[i].x = (as[i].x >= MO2) ? (as[i].x - MO2) : as[i].x;  // < 2 MO
    as[i].x = (as[i].x >= MO) ? (as[i].x - MO) : as[i].x;  // < MO
  }
}

// as[i] <- (1/n) \sum_j \zeta^(-ij) as[rev(j)]
void invFft(Mint *as, int n) {
  assert(!(n & (n - 1))); assert(1 <= n); assert(n <= 1 << FFT_MAX);
  int m = 1;
  if (m < n >> 1) {
    Mint prod = 1U;
    for (int h = 0, i0 = 0; i0 < n; i0 += (m << 1)) {
      for (int i = i0; i < i0 + m; ++i) {
        const unsigned long long y = as[i].x + MO - as[i + m].x;  // < 2 MO
        as[i].x += as[i + m].x;  // < 2 MO
        as[i + m].x = (prod.x * y) % MO;  // < MO
      }
      prod *= INV_FFT_RATIOS[__builtin_ctz(++h)];
    }
    m <<= 1;
  }
  for (; m < n >> 1; m <<= 1) {
    Mint prod = 1U;
    for (int h = 0, i0 = 0; i0 < n; i0 += (m << 1)) {
      for (int i = i0; i < i0 + (m >> 1); ++i) {
        const unsigned long long y = as[i].x + MO2 - as[i + m].x;  // < 4 MO
        as[i].x += as[i + m].x;  // < 4 MO
        as[i].x = (as[i].x >= MO2) ? (as[i].x - MO2) : as[i].x;  // < 2 MO
        as[i + m].x = (prod.x * y) % MO;  // < MO
      }
      for (int i = i0 + (m >> 1); i < i0 + m; ++i) {
        const unsigned long long y = as[i].x + MO - as[i + m].x;  // < 2 MO
        as[i].x += as[i + m].x;  // < 2 MO
        as[i + m].x = (prod.x * y) % MO;  // < MO
      }
      prod *= INV_FFT_RATIOS[__builtin_ctz(++h)];
    }
  }
  if (m < n) {
    for (int i = 0; i < m; ++i) {
      const unsigned y = as[i].x + MO2 - as[i + m].x;  // < 4 MO
      as[i].x += as[i + m].x;  // < 4 MO
      as[i + m].x = y;  // < 4 MO
    }
  }
  const Mint invN = Mint(n).inv();
  for (int i = 0; i < n; ++i) {
    as[i] *= invN;
  }
}

void fft(vector<Mint> &as) {
  fft(as.data(), as.size());
}
void invFft(vector<Mint> &as) {
  invFft(as.data(), as.size());
}

vector<Mint> convolve(vector<Mint> as, vector<Mint> bs) {
  if (as.empty() || bs.empty()) return {};
  const int len = as.size() + bs.size() - 1;
  int n = 1;
  for (; n < len; n <<= 1) {}
  as.resize(n); fft(as);
  bs.resize(n); fft(bs);
  for (int i = 0; i < n; ++i) as[i] *= bs[i];
  invFft(as);
  as.resize(len);
  return as;
}
vector<Mint> square(vector<Mint> as) {
  if (as.empty()) return {};
  const int len = as.size() + as.size() - 1;
  int n = 1;
  for (; n < len; n <<= 1) {}
  as.resize(n); fft(as);
  for (int i = 0; i < n; ++i) as[i] *= as[i];
  invFft(as);
  as.resize(len);
  return as;
}
////////////////////////////////////////////////////////////////////////////////


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 {
int LEN;
int LENS[2010];
Mint DP[2010][16010];
// *= (1 + W X^d + ... + W^f X^(fd))
void UPDATE(int f, int d) {
  LEN += f;
  for (int w = 1; w < LEN; ++w) chmax(LENS[w], LENS[w - 1] + d);
  for (int w = LEN; --w >= f + 1; ) for (int x = (f + 1) * d; x < LENS[w]; ++x) DP[w][x] -= DP[w - (f + 1)][x - (f + 1) * d];
  for (int w = 1; w < LEN; ++w) for (int x = d; x < LENS[w]; ++x) DP[w][x] += DP[w - 1][x - d];
}

Mint run() {
  dp = {1};
  for (int a = 2; a <= 10; ++a) if (a % 2 == 0) update(F[a], 10 - a);
  
  LEN = 1;
  memset(LENS, 0, sizeof(LENS));
  memset(DP, 0, sizeof(DP));
  LENS[0] = dp.size();
  copy(dp.begin(), dp.end(), DP[0]);
  for (int a = 2; a <= 10; ++a) if (a % 2 != 0) UPDATE(F[a], 10 - a);
  
  vector<Mint> ways(10 * N + 1, 0);
  for (int w = 0; w < LEN; ++w) for (int x = 0; x < LENS[w]; ++x) if (DP[w][x]) {
    for (int f1 = 0; f1 <= F[1]; ++f1) for (int f11 = 0; f11 <= F[11]; ++f11) {
      int heal = x;
      const int g1 = min(f1, w + f11);
      heal += g1 * (+9);
      heal += ((f1 - g1 + 1) / 2) * (-1);
      heal += ((f1 - g1) / 2) * (+9);
      ways[N + (heal - f11)] += DP[w][x];
    }
  }
cerr<<"ways = "<<ways<<endl;
  Mint ans = 0;
  for (int i = 0; i < (int)ways.size(); ++i) if (ways[i]) {
    for (int f12 = 0; f12 <= F[12]; ++f12) {
      const int skip = max(f12 * 2 - (i - N), 0) / 10;
      ans += ways[i] * skip;
    }
  }
  
cerr<<"ans = "<<ans<<endl;
  const Mint eas = easy();
  ans = eas - ans;
  return ans;
}
}  // slow


namespace fast {
int LEN;
int LENS[2010];
Mint DP[2010][16010];
// *= (1 + W X^d + ... + W^f X^(fd))
void UPDATE(int f, int d) {
  LEN += f;
  for (int w = 1; w < LEN; ++w) chmax(LENS[w], LENS[w - 1] + d);
  for (int w = LEN; --w >= f + 1; ) for (int x = (f + 1) * d; x < LENS[w]; ++x) DP[w][x] -= DP[w - (f + 1)][x - (f + 1) * d];
  for (int w = 1; w < LEN; ++w) for (int x = d; x < LENS[w]; ++x) DP[w][x] += DP[w - 1][x - d];
}

Mint run() {
  dp = {1};
  for (int a = 2; a <= 10; ++a) if (a % 2 == 0) update(F[a], 10 - a);
  
  LEN = 1;
  memset(LENS, 0, sizeof(LENS));
  memset(DP, 0, sizeof(DP));
  LENS[0] = dp.size();
  copy(dp.begin(), dp.end(), DP[0]);
  for (int a = 2; a <= 10; ++a) if (a % 2 != 0) UPDATE(F[a], 10 - a);
  
  vector<Mint> ways(10 * N + 1, 0);
  for (int w = 0; w < LEN; ++w) {
    vector<int> coef(10 * N + 1, 0);
    for (int f1 = 0; f1 <= F[1]; ++f1) for (int f11 = 0; f11 <= F[11]; ++f11) {
      int heal = 0;
      const int g1 = min(f1, w + f11);
      heal += g1 * (+9);
      heal += ((f1 - g1 + 1) / 2) * (-1);
      heal += ((f1 - g1) / 2) * (+9);
      ++coef[N + (heal - f11)];
    }
    int lb = coef.size(), ub = -1;
    for (int i = 0; i < (int)coef.size(); ++i) if (coef[i]) {
      chmin(lb, i);
      chmax(ub, i);
    }
    if (lb <= ub) {
      const auto prod = convolve(
        vector<Mint>(coef.begin() + lb, coef.begin() + (ub + 1)),
        vector<Mint>(DP[w], DP[w] + LENS[w])
      );
      for (int i = 0; i < (int)prod.size(); ++i) {
        ways[lb + i] += prod[i];
      }
    }
  }
cerr<<"ways = "<<ways<<endl;
  Mint ans = 0;
  for (int i = 0; i < (int)ways.size(); ++i) if (ways[i]) {
    for (int f12 = 0; f12 <= F[12]; ++f12) {
      const int skip = max(f12 * 2 - (i - N), 0) / 10;
      ans += ways[i] * skip;
    }
  }
  
cerr<<"ans = "<<ans<<endl;
  const Mint eas = easy();
  ans = eas - ans;
  return ans;
}
}  // fast


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 = fast::run();
    printf("%u\n", ans.x);
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}