#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;

typedef modint998244353 mint;
typedef long long ll;

//defmodfact
const int COMinitMAX = 998244;
mint fact[COMinitMAX+1], factinv[COMinitMAX+1];

void modfact(){
	fact[0] = 1;
	for (int i=1; i<=COMinitMAX; i++){
		fact[i] = fact[i-1] * i;
	}
	factinv[COMinitMAX] = fact[COMinitMAX].inv();
	for (int i=COMinitMAX-1; i>=0; i--){
		factinv[i] = factinv[i+1] * (i+1);
	}
}

mint cmb(int a, int b){
	if (a<b || b<0) return mint(0);
	return fact[a]*factinv[b]*factinv[a-b];
}
//--------


int main(){
	modfact();
	int n; cin >> n;
	mint summer = 0, fall = 0, winter = 0, spring = 0;
	ll targ = 0;
	vector<mint> a1(100001);
	vector<mint> a2(100001);
	vector<mint> a3(100001);
	for (int i=0; i<n; i++){
		char c; cin >> c;
		if (c == 'U') summer++;
		if (c == 'F') fall++;
		if (c == 'W') winter++;
		if (c == 'P') spring++;
		int a; cin >> a;
		targ += a;
		if (c == 'U') a1[a]++;
		if (c == 'F') a2[a]++;
		if (c == 'W') a3[a]++;
	}
	vector<mint> a12 = convolution(a1, a2);
	vector<mint> a13 = convolution(a1, a3);
	vector<mint> a23 = convolution(a2, a3);
	vector<mint> a123 = convolution(a23, a1);
	mint ans = mint(n-1).pow(targ) * summer * fall * winter;
	for (int i=0; i<(int)a123.size(); i++){
		if (targ - i < 0 ) break;
		ans -= a123[i] * mint(n-2).pow(i) * mint(n-1).pow(targ - i);
	}
	for (int i=0; i<(int)a12.size(); i++){
		if (targ - i < 0 ) break;
		ans += a12[i] * mint(n-2).pow(i) * mint(n-1).pow(targ - i) * winter;
	}
	for (int i=0; i<(int)a13.size(); i++){
		if (targ - i < 0 ) break;
		ans += a13[i] * mint(n-2).pow(i) * mint(n-1).pow(targ - i) * fall;
	}
	for (int i=0; i<(int)a23.size(); i++){
		if (targ - i < 0 ) break;
		ans += a23[i] * mint(n-2).pow(i) * mint(n-1).pow(targ - i) * summer;
	}
	for (int i=0; i<(int)a1.size(); i++){
		if (targ - i < 0 ) break;
		ans -= a1[i] * mint(n-2).pow(i) * mint(n-1).pow(targ - i) * fall * winter;
	}
	for (int i=0; i<(int)a2.size(); i++){
		if (targ - i < 0 ) break;
		ans -= a2[i] * mint(n-2).pow(i) * mint(n-1).pow(targ - i) * summer * winter;
	}
	for (int i=0; i<(int)a3.size(); i++){
		if (targ - i < 0 ) break;
		ans -= a3[i] * mint(n-2).pow(i) * mint(n-1).pow(targ - i) * summer * fall;
	}
	ans *= spring;
	cout << ans.val() << endl;
}