#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<vector<int>>v(4);
	rep(i, n) {
		char c; cin >> c;
		int a; cin >> a;
		if ('U' == c)v[0].push_back(a);
		else if ('F' == c)v[1].push_back(a);
		else if ('W' == c)v[2].push_back(a);
		else v[3].push_back(a);
	}
	vector<mint>pw0(100005, 1);
	vector<mint>pw1(100005, 1);
	rep2(i, 1, pw0.size())pw0[i] *= pw0[i - 1] * (n - 2);
	rep2(i, 1, pw1.size())pw1[i] *= pw1[i - 1] * (n - 1);
	mint ans = 1;
	rep(i, 4) {
		long long sa = 0;
		mint sub = 0;
		rep(j, v[i].size())sa += v[i][j];
		mint memo = pow_mod(n - 1, sa, mod);
		if (3 == i) {
			ans *= memo * v[3].size();
			continue;
		}
		rep(j, v[i].size()) {
			sub += memo / pw1[v[i][j]] * (pw1[v[i][j]] - pw0[v[i][j]]);
		}
		ans *= sub;
	}
	cout << ans.val() << endl;
	return 0;
}