/* -*- coding: utf-8 -*-
 *
 * 2783.cc:  No.2783 4-33 Easy - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 2000;
const int SA = 4;
const int SB = 33;
const int MOD = 998244353;

/* typedef */

/* global variables */

int as[MAX_N], bs[MAX_N];
bool xs[MAX_N];
int dp[2][9][SA + 1][SB + 1];

/* subroutines */

inline void addmod(int &a, int b) { a = (a + b) % MOD; }

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 0; i < n; i++) scanf("%d", as + i);

  for (int i = 0; i < n; i++) {
    char s[8];
    scanf("%s", s);
    bs[i] = 0, xs[i] = false;
    for (int j = 0; s[j]; j++) {
      if (s[j] == 'X') xs[i] = true;
      else bs[i] = bs[i] * 10 + (s[j] - '0');
    }
    //printf(" %d,%d\n", bs[i], xs[i]);
  }

  int sum = 0;
  for (int i9 = 0; i9 < n; i9++) {
    if (! (bs[i9] == 0 && xs[i9])) continue;
	
    for (int j = 0; j < 9; j++)
      for (int ka = 0; ka <= SA; ka++)
	fill(dp[0][j][ka], dp[0][j][ka] + SB + 1, 0);
    dp[0][0][0][0] = 1;
    int cur = 0, nxt = 1;

    for (int i = 0; i < n; i++) {
      if (i == i9 || xs[i]) continue;
      
      for (int j = 0; j < 9; j++)
	for (int ka = 0; ka <= SA; ka++)
	  copy(dp[cur][j][ka], dp[cur][j][ka] + SB + 1,
	       dp[nxt][j][ka]);

      for (int j = 0; j < 8; j++)
	for (int ka = 0; ka <= SA; ka++)
	  for (int kb = 0; kb <= SB; kb++)
	    if (dp[cur][j][ka][kb] &&
		ka + as[i] <= SA && kb + bs[i] <= SB)
	      addmod(dp[nxt][j + 1][ka + as[i]][kb + bs[i]],
		     dp[cur][j][ka][kb]);
      swap(cur, nxt);
    }

    int sa8 = SA - as[i9], sb9 = SB - bs[i9];
    addmod(sum, dp[cur][8][sa8][sb9]);
  }

  printf("%d\n", sum);
	 
  return 0;
}