n = int(input()); m = 10**5; mod = 998244353
u = []; f = []; w = []; p = []
for _ in range(n):
    s,a = input().split(); a = int(a)
    if s=="U": u.append(a)
    if s=="F": f.append(a)
    if s=="W": w.append(a)
    if s=="P": p.append(a)
r1 = [1]*(m+1); r2 = [1]*(m+1)
for i in range(m): r1[i+1] = r1[i]*(n-1)%mod; r2[i+1] = r2[i]*(n-2)%mod
n1 = sum(u); n2 = sum(f); n3 = sum(w)
s1 = s2 = s3 = 0; s4 = pow(n-1,sum(p),mod)*len(p)%mod
for v in u: s1 += (pow(n-1,v,mod)-pow(n-2,v,mod))*pow(n-1,n1-v,mod)%mod
for v in f: s2 += (pow(n-1,v,mod)-pow(n-2,v,mod))*pow(n-1,n2-v,mod)%mod
for v in w: s3 += (pow(n-1,v,mod)-pow(n-2,v,mod))*pow(n-1,n3-v,mod)%mod
print(s1*s2*s3*s4%mod)