#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<ll, ll> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 1050;
int n, a[N], nxt[N], b[N], nxt2[N];
int ok[N], vis[N][N];
PII f[N];
void calc(int u);
PII dfs(int u, int rt){
    if(vis[u][rt]) return make_pair(-1, -1);
    vis[u][rt] = 1;
    if(a[u] == b[rt]) return make_pair(0, u);
    if(!ok[u]) calc(u);
    if(ok[u] == -1) return make_pair(-1, -1);
    PII cur = dfs(nxt[f[u].se], rt);
    if(cur.fi == -1) return cur;
    return make_pair((f[u].fi + 1 + cur.fi) % mod, cur.se);
}
void calc(int u){
    PII cur = dfs(nxt2[u], u);
    if(cur.fi == -1) f[u] = {-1, -1}, ok[u] = -1;
    else f[u] = make_pair((cur.fi + 1) % mod, cur.se), ok[u] = 1;
}
int main(){
    read(n);
    _rep(i, 1, n){
        char ch[10]; scanf("%s", ch);
        if(ch[0] == 'H') scanf(" PUSH %d GOTO %d", &b[i], &nxt2[i]);
        else scanf(" %d GOTO %d; PUSH %d GOTO %d", &a[i], &nxt[i], &b[i], &nxt2[i]);
        // debug("(%d,%d,%d,%d)\n", a[i], nxt[i], b[i], nxt2[i]);
    }    
    nxt2[0] = 1;
    calc(0);
    writeln(f[0].fi);
    return 0;
}