using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var a = NList;
        var b = ReadLine().Split();
        var ninex = new int[5];
        var cards = new List<(int a, int b)>();
        for (var i = 0; i < n; ++i)
        {
            if (b[i].Contains('X'))
            {
                if (b[i] == "X")
                {
                    ++ninex[a[i]];
                }
            }
            else cards.Add((a[i], int.Parse(b[i])));
        }
        var mod = 998_244_353;
        var dp = new long[10][];
        for (var i = 0; i < dp.Length; ++i) dp[i] = new long[434];
        dp[0][0] = 1;
        for (var i = 0; i < cards.Count; ++i)
        {
            var ndp = new long[10][];
            for (var j = 0; j < ndp.Length; ++j) ndp[j] = new long[434];
            for (var j = 0; j < dp.Length; ++j) for (var k = 0; k < dp[j].Length; ++k)
            {
                ndp[j][k] = (ndp[j][k] + dp[j][k]) % mod;
                var p = k / 100;
                var q = k % 100;
                if (j + 1 < ndp.Length && p + cards[i].a <= 4 && q + cards[i].b <= 33)
                    ndp[j + 1][k + cards[i].a * 100 + cards[i].b] =
                        (ndp[j + 1][k + cards[i].a * 100 + cards[i].b] + dp[j][k]) % mod;
            }
            dp = ndp;
        }
        WriteLine(
            (dp[8][33] * ninex[4] + dp[8][133] * ninex[3] + dp[8][233] * ninex[2] + dp[8][333] * ninex[1]
            + dp[8][433] * ninex[0]) % mod
        );
    }
    static int GetPt(string x)
    {
        x = x.Replace("X", "");
        if (x == "") return 0;
        return int.Parse(x);
    }
    static long GCD(long a, long b)
    {
        if (a < b) return GCD(b, a);
        if (a % b == 0) return b;
        return GCD(b, a % b);
    }
}