import sys
from sys import stdin
import math
import heapq

N = int(stdin.readline())

SA = [ [] for i in range(4) ]

for i in range(N):

    S,A = stdin.readline().split()
    A = int(A)

    if S == "U":
        SA[0].append(A)
    if S == "F":
        SA[1].append(A)
    if S == "W":
        SA[2].append(A)
    if S == "P":
        SA[3].append(A)

mod = 998244353

if [] in SA:
    print (0)
    sys.exit()

ans = 1

for i in range(3):

    now = 0
    nex_size = len(SA[i+1])

    rema = sum(SA[i])
    for a in SA[i]:
        patt = pow(N-1,a,mod) - pow(N-2,a,mod)
        now += patt * pow(N-1,rema-a,mod)
        now %= mod
    ans *= now
    ans %= mod

    #print (now)

ans *= len(SA[-1])
ans *= pow(N-1,sum(SA[-1]),mod)
print (ans % mod)