MOD = 998244353

def main():
    import sys
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr])
    ptr += 1
    
    sum_A = 0
    U = []
    F = []
    W = []
    P_count = 0
    
    for _ in range(N):
        S_i = input[ptr]
        A_i = int(input[ptr+1])
        ptr += 2
        sum_A += A_i
        
        if S_i == 'U':
            U.append(A_i)
        elif S_i == 'F':
            F.append(A_i)
        elif S_i == 'W':
            W.append(A_i)
        elif S_i == 'P':
            P_count += 1
    
    # Compute inv(N-1)
    inv_N_1 = pow(N-1, MOD-2, MOD) if (N-1) != 0 else 0
    # base = (N-2) / (N-1) mod MOD
    base = ( ( (N - 2) % MOD ) * inv_N_1 ) % MOD
    
    def compute_sum(As):
        res = 0
        for a in As:
            x = pow(base, a, MOD)
            term = (1 - x) % MOD
            res = (res + term) % MOD
        return res
    
    u_sum = compute_sum(U)
    f_sum = compute_sum(F)
    w_sum = compute_sum(W)
    
    # Compute sum_S
    sum_S = u_sum * f_sum % MOD
    sum_S = sum_S * w_sum % MOD
    sum_S = sum_S * P_count % MOD
    
    # Compute P = (N-1)^sum_A mod MOD
    P = pow(N-1, sum_A, MOD)
    
    # Answer is (P * sum_S) mod MOD
    print((P * sum_S) % MOD)

if __name__ == '__main__':
    main()