#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

#include "atcoder/modint"

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

using mint = atcoder::modint998244353;

int ctoi(char c) {
    if (c == 'U') return 0;
    if (c == 'F') return 1;
    if (c == 'W') return 2;
    return 3;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin >> N;
    vector<vector<int>> A(4);
    for (int i = 0; i < N; i++) {
        char c;
        int a;
        cin >> c >> a;
        A[ctoi(c)].emplace_back(a);
    }

    mint ans = 1;
    for (int i = 0; i < 3; i++) {
        ll sum = accumulate(all(A[i]), 0LL);
        mint nans = 0;
        for (int& x : A[i]) {
            nans += ans * mint(N - 1).pow(sum - x) * (mint(N - 1).pow(x) - mint(N - 2).pow(x));
        }
        swap(ans, nans);
    }
    {
        ll sum = accumulate(all(A[3]), 0LL);
        ans *= mint(N - 1).pow(sum);
        ans *= A[3].size();
    }

    cout << ans.val() << '\n';
    return 0;
}