import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(1000005)
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 << 63)-1
# md = 10**9+7
md = 998244353

n = II()
ii = [[] for _ in range(4)]
aa = [0]*n
t = "UFWP"
cc = [0]*4
for i in range(n):
    s, a = SI().split()
    s = t.find(s)
    ii[s].append(i)
    a = int(a)
    aa[i] = a
    cc[s] += a

tot = [0]*4+[1]
for s in range(3):
    for i in ii[s]:
        a=aa[i]
        cur = (pow(n-1, a, md)-pow(n-2, a, md))*pow(n-1, cc[s]-a, md)%md*tot[s-1]%md
        tot[s] += cur
        tot[s] %= md

ans=tot[2]*pow(n-1,cc[3],md)%md*len(ii[3])%md
print(ans)