#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const ll modc = 998244353;
class mint {
    ll x;
public:
    mint(ll x=0) : x((x%modc+modc)%modc) {}
    mint operator-() const {
      return mint(-x);
    }
    mint& operator+=(const mint& a) {
        if ((x += a.x) >= modc) x -= modc;
        return *this;
    }
    mint& operator-=(const mint& a) {
        if ((x += modc-a.x) >= modc) x -= modc;
        return *this;
    }
    mint& operator*=(const  mint& a) {
        (x *= a.x) %= modc;
        return *this;
    }
    mint operator+(const mint& a) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint& a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint& a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    mint inv() const {
        return pow(modc-2);
    }
    mint& operator/=(const mint& a) {
        return (*this) *= a.inv();
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
    bool operator == (const mint& a) const{
        return x == a.x;
    }
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
    friend istream& operator>>(istream& ip, mint &m) {
        ll t;
        ip >> t;
        m = mint(t);
        return ip;
    }
    ll val(){
        return x;
    }
};

int main(){

    char c;
    ll N, x, S=0, y=0;
    cin >> N;
    map<char, int> mp;
    mp['U'] = 0, mp['F'] = 1, mp['W'] = 2, mp['P'] = 3;
    vector<vector<ll>> A(4);
    for (int i=0; i<N; i++){
        cin >> c >> x;
        S += x;
        if (c == 'P') y++;
        A[mp[c]].push_back(x);
    }

    for (int i=0; i<4; i++){
        if (A[i].size() == 0){
            cout << 0 << endl;
            return 0;
        }
    }

    mint ans = mint(N-1).pow(S) * y, ni = mint(N-1).inv(), sm;

    for (int i=0; i<3; i++){
        sm = 0;
        for (auto x : A[i]) sm += (mint(N-1).pow(x) - mint(N-2).pow(x)) * ni.pow(x);
        ans *= sm;
    }

    cout << ans << endl;

    return 0;
}