#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll const m = 998244353;
ll mpow(ll a, ll n) {
	ll ret = 1;
	while (n) {
		if (n & 1) ret = (ret * a) % m;
		n >>= 1;
		a = (a * a) % m;
	}
	return ret;
}
int main () {
	int N;
	cin >> N;
	string key = "UFWP";
	ll al = (N - 2);
	al = (al * mpow(N - 1, m - 2)) % m;
	ll num[] = {0, 0, 0, 0}, xi[] = {0, 0, 0, 0};
	ll ss = 0;
	for (int i = 0; i < N; i ++) {
		char c;
		cin >> c;
		int fl = 0;
		while (key[fl] != c) fl ++;
		ll a;
		cin >> a;
		ss += a;
		num[fl] ++;
		xi[fl] = (xi[fl] + mpow(al, a)) % m;
	}
	ll bs = mpow(N - 1, ss);
	ll ans1 = bs;
	for (int i = 0; i < 4; i ++) ans1 = (ans1 * num[i]) % m;
	ll ans2 = 0;
	for (int i = 0; i < 3; i ++) {
		ll kj = xi[i];
		for (int j = 1; j < 4; j ++) {
			kj = (kj * num[(i + j) % 4]) % m;
		}
		ans2 = (ans2 + kj * bs) % m;
	}
	ll ans3 = 0;
	for (int p = 0; p < 3; p ++) {
		for (int q = p + 1; q < 3; q ++) {
			ll kj = (xi[p] * xi[q]) % m;
			for (int i = 0; i < 4; i ++) {
				if (i != p && i != q) kj = (kj * num[i]) % m;
			}
			ans3 = (ans3 + kj) % m;
		}
	}
	ans3 = (ans3 * bs) % m;
	ll ans4 = (bs * num[3]) % m;
	for (int i = 0; i < 3; i ++) ans4 = (ans4 * xi[i]) % m;
	cout << (m * 4 + ans1 - ans2 + ans3 - ans4) % m << endl;
}