#include<bits/stdc++.h>
#define inf 0x3f3f3f3f
#define llinf 0x3f3f3f3f3f3f3f3f
#define vi vector <int>
#define vvi vector <vi>
#define endl '\n'
#define ll long long
using namespace std;

constexpr int mod = 998244353, N = 1030, M = 2e5 + 5;

int n;
int A[N], X[N], B[N], Y[N];
ll cnt[N][N], to[N][N];
bool vis[N][N];

void dfs(int p, int e)
{
	if(!p) return;
	if(vis[p][e]){
		printf("-1\n");
		exit(0);
	}
	vis[p][e] = true;
	if(A[p] == e){
		cnt[p][e] = 1;
		to[p][e] = X[p];
	}
	else{
		dfs(Y[p], B[p]);
		dfs(to[Y[p]][B[p]], e);
		cnt[p][e] = (cnt[Y[p]][B[p]] + cnt[to[Y[p]][B[p]]][e] + 1) % mod;
		to[p][e] = to[to[Y[p]][B[p]]][e];
	}
	vis[p][e] = false;
	return;
}

void solve()
{
	scanf("%d", &n);
	char str[20];
	for(int i = 1; i <= n; i ++){
		scanf("%s", str);
		if(string(str) == "HALT;"){
			A[i] = B[i] = 0;
			scanf(" PUSH %d GOTO %d", &B[i], &Y[i]);
		}
		else{
			scanf(" %d GOTO %d; PUSH %d GOTO %d", &A[i], &X[i], &B[i], &Y[i]);
		}
	}
	
	dfs(1, 0);
	printf("%d\n", cnt[1][0]);
}

int main()
{
//	ios::sync_with_stdio(false);
//	cin.tie(0); //cout.tie(0);
	
	int t = 1;
	//cin >> t; 
	while(t --) solve();
	
	return 0;
}