/*
8
POP 2 GOTO 2; PUSH 1 GOTO 2
POP 2 GOTO 3; PUSH 1 GOTO 3
POP 2 GOTO 4; PUSH 1 GOTO 4
POP 10 GOTO 5; PUSH 2 GOTO 5
POP 2 GOTO 6; PUSH 10 GOTO 6
POP 1 GOTO 4; PUSH 1 GOTO 7
POP 1 GOTI 8; PUSH 1 GOTO 7
HALT; PUSH 99 GOTO 4
*/

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

struct Node{
    int a, b, c, d;
}p[1025];

const int mod = 998244353;
pair<int, int> f[1025][1025];
bool ins[1025][1025];

// 从x开始当前栈顶是pre, 最后把这个pre弹出的步数
pair<int, int> dp(int pre, int x){
    if (ins[pre][x]) return {-2, -2};
    if (p[x].a == pre) return {1, p[x].b};
    if (f[pre][x] != pair{-1, -1}) return f[pre][x];
    ins[pre][x] = true;
    auto [ans1, out1] = dp(p[x].c, p[x].d);
    if (ans1 == -2){
        ins[pre][x] = false;
        return f[pre][x] = {-2, -2};
    }
    auto [ans2, out2] = dp(pre, out1);
    if (ans2 == -2){
        ins[pre][x] = false;
        return f[pre][x] = {-2, -2};
    }
    ins[pre][x] = false;
    return f[pre][x] = {(ans1 + ans2 + 1) % mod, out2};
}

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);

    memset(f, -1, sizeof f);
    int n;
    cin >> n;
    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};
        }
    }
    auto [len, out] = dp(0, 1);
    if (len < 0) cout << -1 << '\n';
    else cout << len << '\n';

}