#include using namespace std; const int MOD = 998244353; int main() { int N; cin >> N; vector A(N); vector B(N); for (int i = 0; i < N; i++) { cin >> A[i]; } for (int i = 0; i < N; i++) { cin >> B[i]; } vector DP(N + 1, vector(11, vector(6, vector(35, 0LL)))); DP[0][0][0][0] = 1; for (int i = 0; i < N; i++) { for (int j = 0; j <= 9; j++) { for (int k = 0; k <= 4; k++) { for (int l = 0; l <= 33; l++) { if (DP[i][j][k][l]) { DP[i + 1][j][k][l] += DP[i][j][k][l]; DP[i + 1][j][k][l] %= MOD; if (B[i].back() != 'X') { if (k + A[i] <= 4 && l + stoi(B[i]) <= 33) { DP[i + 1][j + 1][k + A[i]][l + stoi(B[i])] += DP[i][j][k][l]; DP[i + 1][j + 1][k + A[i]][l + stoi(B[i])] %= MOD; } } } } } } } long long ans = 0; for (int i = 0; i < N; i++) { if (B[i] == "X") { ans += DP[N][8][4 - A[i]][33]; ans %= MOD; } } cout << ans << endl; }