#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
using LL = long long;

struct Node{
    int a, b, c, d;
};

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n;
    cin >> n;
    vector<Node> p(n + 1);
    for(int i = 1; i <= n; i++){
        string s;
        cin >> s;
        if (s[0] == 'H'){
            string _; int v1, v2;
            cin >> _ >> v1 >> _ >> v2;
            p[i] = {0, 0, v1, v2}; 
        }
        else{
            string _; int v1, v2, v3, v4;
            cin >> v1 >> _ >> v2 >> _ >> _ >> v3 >> _ >> v4;
            p[i] = {v1, v2, v3, v4};
        }
    }
    vector<int> len1(n + 1, -1), len2(n + 1, -1), out(n + 1);
    for(int i = 1; i <= n; i++) out[i] = i;
    for(int i = 1; i <= n; i++){
        auto [a, b, c, d] = p[i];
        if (a == 0){
            len1[i] = 0;
        }
        if (p[d].a == c){
            len2[i] = 2;
            out[i] = p[d].b;
        }
    }

    const int mod = 998244353;
    for(int _ = 0; _ < n; _++){
        for(int i = 1; i <= n; i++){
            if (len2[i] != -1 and len2[out[i]] != -1){
                len2[i] += len2[out[i]];
                if (len2[i] >= mod) len2[i] -= mod;
                out[i] = out[out[i]];
            }
            if (len1[i] == -1 and len1[out[i]] != -1){
                len1[i] = len2[i] + len1[out[i]];
                if (len1[i] >= mod) len1[i] -= mod;
            }
        }
        for(int i = 1; i <= n; i++){
            auto [a, b, c, d] = p[i];
            if (len2[i] == -1){
                if (len2[d] != -1 and p[out[d]].a == c){
                    len2[i] = len2[d] + 2;
                    if (len2[i] >= mod) len2[i] -= mod;
                    out[i] = p[out[d]].b;
                    if (p[out[i]].a == 0 and len1[i] == -1){
                        len1[i] = len2[i];
                    }
                }
            }
        }
    }
    if (len1[1] == -1) cout << -1 << '\n';
    else cout << (len1[1] + 1) % mod << '\n';

}