#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

mint dp[10][30][70];

int main()
{
    int n;
    cin >> n;
    vector<int> a(n);
    rep(i,n) cin >> a[i];
    vector<string> b(n);
    rep(i,n) cin >> b[i];
    vector<int> c(n), num(n);
    rep(i,n) {
        if(b[i].back()=='X') {
            c[i] = 1;
            b[i].pop_back();
        }
        if(b[i].empty()) {
            num[i] = 0;
            c[i]=-1;
        }
        else num[i] = stoi(b[i]);
    }
    dp[0][0][0] = 1;
    rep(i,n) {
        for(int j=7;j>=0;j--){
            for(int k=4;k>=0;k--){
                for(int l=33;l>=0;l--){
                    if(c[i]==0) dp[j+1][k+a[i]][l+num[i]] += dp[j][k][l]; 
                }
            }
        }
    }
    mint ans = 0;
    rep(i,n) {
        if(c[i]==-1) ans += dp[8][4-a[i]][33-num[i]];

    }
    cout << ans.val() << endl;
    return 0;
}