#include <bits/extc++.h>
#include <atcoder/all>

using namespace std;
using ll = long long;
#define REP(i,n) for(int i=0;i<int(n);i++)
#define FOR(i,a,b) for(int i=a;i<=int(b);i++)
#define ALL(x) x.begin(),x.end()
#define INF INT_MAX
#define INFL LLONG_MAX / 4
using namespace atcoder;
using mint = modint998244353;
template<typename T> void chmin(T& a, T b) { a = min(a, b); }
template<typename T> void chmax(T& a, T b) { a = max(a, b); }
#define PR(x) cerr << #x << "=" << x << endl
using i128 = __int128_t;

template< typename T >
T mod_pow(T x, int64_t n, const T &p) {
  T ret = 1;
  x %= p;
  while(n > 0) {
    if(n & 1) (ret *= x) %= p;
    (x *= x) %= p;
    n >>= 1;
  }
  return ret % p;
}

ll mod = 998244353;
int main() {
  ll n;
  cin >> n;;
  vector<vector<ll>> as(4);
  REP(i, n) {
    char c;
    ll a;
    cin >> c >> a;
    if(c=='U')as[0].push_back(a);
    if(c=='F')as[1].push_back(a);
    if(c=='W')as[2].push_back(a);
    if(c=='P')as[3].push_back(a);
  }
  mint ans = 1;
  REP(i, 4) {
    mint ta = 0;
    REP(j, as[i].size()) {
      if(i<3) ta += mod_pow(n-1, as[i][j], mod) - mod_pow(n-2, as[i][j], mod);
      else ta += mod_pow(n-1, as[i][j], mod);
    }
    ans *= ta;
  }

  cout << ans.val();
  return 0;
}