#include <bits/stdc++.h>
#include <atcoder/all>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <math.h>
#include <random>
#include <chrono>
#include <cstdint>


using namespace std;
using namespace atcoder;
using mint = modint998244353;
// using mint = modint1000000007;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using ll = long long;
template <class T> using max_heap = priority_queue<T>;
template <class T> using min_heap = priority_queue<T, vector<T>, greater<>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, f, n) for (int i = (int) f; i < (int)(n); i++)
#define repd(i, n, l) for (int i = (int) n; i >= (int) l; i--)
#define all(p) p.begin(),p.end()
vector<pair<int, int>> dydx{{-1, 0}, {1, 0}, {0, -1 }, {0, 1}};
const ll inf = 1LL << 60;
void print(){ putchar(' '); }
void print(bool a){ printf("%d", a); }
void print(int a){ printf("%d", a); }
void print(unsigned a){ printf("%u", a); }
void print(long a){ printf("%ld", a); }
void print(long long a){ printf("%lld", a); }
void print(unsigned long long a){ printf("%llu", a); }
void print(char a){ printf("%c", a); }
void print(char a[]){ printf("%s", a); }
void print(const char a[]){ printf("%s", a); }
void print(float a){ printf("%.15f", a); }
void print(double a){ printf("%.15f", a); }
void print(long double a){ printf("%.15Lf", a); }
void print(const string& a){ for(auto&& i : a) print(i); }
template<class T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); }
template<class T> void print(const vector<T>&);
template<class T, size_t size> void print(const array<T, size>&);
template<class T, class L> void print(const pair<T, L>& p);
template<class T, size_t size> void print(const T (&)[size]);
template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }
template<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }
template<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }
template<class T> void print(const T& a){ cout << a; }


int main() {
    int N; cin >> N;
    vector<pair<string, string>> S(N), T;
    rep(i, N) cin >> S[i].first;
    rep(i, N) cin >> S[i].second;
    rep(i, N) {
      if (S[i].second.ends_with('X')){
        T.push_back(S[i]);
        S[i] = {"99", "99"};
      }
    }
    // auto cmp = [&](pair<string, string> a, pair<string, string> b){
    //     // int n = a.second.size();
    //     // int m = b.second.size();
    //     if (!a.second.ends_with('X') && b.second.ends_with('X')) return (a < b);
    //     else if (a.second.ends_with('X') && !b.second.ends_with('X')) return (a > b);
    //     else return (a < b);
    // }; 
    // sort(all(S), cmp);
    // rep(i, N) cout << S[i].first << ' ' << S[i].second << endl;
    vector<vector<vector<mint>>> dp(10, vector<vector<mint>>(5, vector<mint>(34, 0)));
    dp[0][0][0] = 1;
    for (auto [a, b] : S){
        int n = a.size();
        int m = b.size();
        vector<vector<vector<mint>>> ndp(10, vector<vector<mint>>(5, vector<mint>(34, 0)));
            // cout << a << ' ' << b << endl;
            for (int ini = 0; ini <= 8; ini++){
                for (int s1 = 0; s1 <= 4; s1++){
                    for (int s2 = 0; s2 <= 33; s2++){
                        ndp[ini][s1][s2] += dp[ini][s1][s2];
                        int x = stoi(a);
                        int y = stoi(b);
                        if (s1 + x <= 4 && s2 + y <= 33 && ini < 8){
                            ndp[ini+1][s1+x][s2+y] += dp[ini][s1][s2];
                        }
                    }
                }
            }
            swap(ndp, dp);
    }
    for (auto [a, b] : T){    

          if (b.size() > 1) continue;
          // cout << a << ' ' << b << endl;
          int x = stoi(a);
          for (int s1 = 0; s1 <= 4; s1++){
                  for (int s2 = 0; s2 <= 33; s2++){
                  // if (s1 == 4 && s2 == 33) cout << dp[8][s1][s2].val() << endl;
                  if (x + s1 <= 4) dp[9][s1+x][s2] += dp[8][s1][s2];
                  
              }
          }
      }

    cout << dp[9][4][33].val() << endl;
    return 0;
    
}