#include <bits/stdc++.h>
using namespace std;

template<const unsigned int MOD> struct prime_modint {
    using mint = prime_modint;
    unsigned int v;
    prime_modint() : v(0) {}
    prime_modint(unsigned int a) { a %= MOD; v = a; }
    prime_modint(unsigned long long a) { a %= MOD; v = a; }
    prime_modint(int a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    prime_modint(long long a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    static constexpr int mod() { return MOD; }
    mint& operator++() {v++; if(v == MOD)v = 0; return *this;}
    mint& operator--() {if(v == 0)v = MOD; v--; return *this;}
    mint operator++(int) { mint result = *this; ++*this; return result; }
    mint operator--(int) { mint result = *this; --*this; return result; }
    mint& operator+=(const mint& rhs) { v += rhs.v; if(v >= MOD) v -= MOD; return *this; }
    mint& operator-=(const mint& rhs) { if(v < rhs.v) v += MOD; v -= rhs.v; return *this; }
    mint& operator*=(const mint& rhs) {
        v = (unsigned int)((unsigned long long)(v) * rhs.v % MOD);
        return *this;
    }
    mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }
    mint operator+() const { return *this; }
    mint operator-() const { return mint() - *this; }
    mint pow(long long n) const {
        assert(0 <= n);
        mint r = 1, x = *this;
        while (n) {
            if (n & 1) r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    mint inv() const { assert(v); return pow(MOD - 2); }
    friend mint operator+(const mint& lhs, const mint& rhs) { return mint(lhs) += rhs; }
    friend mint operator-(const mint& lhs, const mint& rhs) { return mint(lhs) -= rhs; }
    friend mint operator*(const mint& lhs, const mint& rhs) { return mint(lhs) *= rhs; }
    friend mint operator/(const mint& lhs, const mint& rhs) { return mint(lhs) /= rhs; }
    friend bool operator==(const mint& lhs, const mint& rhs) { return (lhs.v == rhs.v); }
    friend bool operator!=(const mint& lhs, const mint& rhs) { return (lhs.v != rhs.v); }
    friend std::ostream& operator << (std::ostream &os, const mint& rhs) noexcept { return os << rhs.v; }
};
//using mint = prime_modint<1000000007>;
using mint = prime_modint<998244353>;

template<class T> istream& operator >> (istream& is, vector<T>& vec) {
    for(T& x : vec) is >> x;
    return is;
}

template<class T> ostream& operator << (ostream& os, const vector<T>& vec) {
    if(vec.empty()) return os;
    os << vec[0];
    for(auto it = vec.begin(); ++it != vec.end(); ) os << ' ' << *it;
    return os;
}


int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<int> a(n), pos(n);
    vector<string> b(n);
    cin >> a >> b;
    vector dp(10, vector(5, vector<mint>(34)));
    dp[0][0][0] = 1;
    iota(pos.begin(), pos.end(), 0);
    sort(pos.begin(), pos.end(), [&](int lhs, int rhs){
        return b[lhs].back() < b[rhs].back();
    });
    for(auto &&i : pos){
        int v1 = a[i];
        int v2 = 0;
        if(b[i].back() == 'X'){
            b[i].pop_back();
            if(b[i].size() >= 1) v2 = stoi(b[i]);
            for(int j = 0; v1 + j <= 4; j++){
                for(int k = 0; v2 + k <= 33; k++){
                    int as = v1 + j;
                    int bs = v2 + k;
                    if(v2 == 0){
                        dp[9][as][bs] += dp[8][j][k];
                    }else{
                        if(as >= bs - 4) dp[9][as][bs] += dp[8][j][k];
                    }
                }
            }
        }else{
            v2 = stoi(b[i]);
            for(int j = 7; j >= 0; j--){
                for(int k = 0; v1 + k <= 4; k++){
                    for(int l = 0; v2 + l <= 33; l++){
                        dp[j + 1][v1 + k][v2 + l] += dp[j][k][l];
                    }
                }
            }
        }
    }
    cout << dp[9][4][33] << '\n';
}