import sys

# sys.setrecursionlimit(1000006)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

n=II()
aa=LI()
bb=SI().split()

ab=[]
ud=[]
for a,b in zip(aa,bb):
    if b[-1]=="X":
        b=b[:-1]
        if b=="":
            ud.append((a,0))
        # else:
        # # elif int(b)>=29:
        #     b=int(b)
        #     ud.append((a,b))
    else:
        b=int(b)
        ab.append((a,b))

dp=[[[0]*34 for _ in range(5)] for _ in range(9)]
dp[0][0][0]=1

for a,b in ab:
    for i in range(8)[::-1]:
        for j in range(5-a):
            for k in range(34-b):
                pre=dp[i][j][k]%md
                if pre==0:continue
                dp[i+1][j+a][k+b]+=pre

ans=0
for a,b in ud:
    ans+=dp[8][4-a][33-b]
    ans%=md
print(ans)