#include <bits/stdc++.h>

using namespace std;

#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)
#define sz(a) ((int)((a).size()))
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define all(a) (a).begin(), (a).end()
#define endl "\n"

typedef pair<int, int> pt;
typedef long long li;
typedef long double ld;

const li INF64 = (li)(1e18);
const int INF = (int)(1e9);
const int MOD = 998244353;

int add(int a, int b){
	a += b;
	if (a >= MOD)
		a -= MOD;
	if (a < 0)
		a += MOD;
	return a;
}

int mul(int a, int b){
	return a * 1ll * b % MOD;
}

int binpow(int a, int b){
	int res = 1;
	while (b){
		if (b & 1)
			res = mul(res, a);
		a = mul(a, a);
		b >>= 1;
	}
	return res;
}


struct command
{
	int cond, go1, add0, go0;
	command(int cond = -1, int go1 = -1, int add0 = -1, int go0 = -1) : cond(cond), go1(go1), add0(add0), go0(go0) {};
};

int n;
vector<command> commands;

bool read()
{
	cin >> n;
	commands.resize(n);
	forn(i, n)
	{
		string s1;
		cin >> s1;
		if(s1 == "HALT;")
		{
			cin >> s1;
			int x;
			cin >> x;
			cin >> s1;
			int y;
			cin >> y;
			--y;
			commands[i] = command(-1, -1, x, y);
		}
		else
		{
			int x;
			cin >> x;
			cin >> s1;
			cin >> s1;
			int y = stoi(s1.substr(0, sz(s1) - 1));
			--y;
			cin >> s1;
			int z;
			cin >> z;
			cin >> s1;
			int a;
			cin >> a;
			--a;
			commands[i] = command(x, y, z, a);
		}
	}
	return true;
}

mt19937 rnd(time(NULL));

int solve_one(vector<int>& p)
{
	vector<bool> done(n);
	vector<pair<int, int>> cur(n);
	forn(i, n)
	{
		done[i] = false;
		cur[i] = mp(1, commands[i].go0);
	}
	//forn(i, n) cout << i << " " << commands[i].cond << " " << commands[i].go1 << " " << commands[i].add0 << " " << commands[i].go0 << endl;
	while(true)
	{
		//forn(i, n) cout << i << " " << cur[i].x << " " << cur[i].y << endl;
		int j = -1;
		forn(i, n)
		{
			int x = p[i];
			if(done[x]) continue;
			if(commands[cur[x].y].cond == commands[x].add0)
			{
				j = x;
				break;
			}
		}
		//cout << j << endl;
		if(j == -1) break;
		done[j] = true;
		cur[j].x = add(cur[j].x, 1);
		cur[j].y = commands[cur[j].y].go1;
		forn(i, n)
			if(!done[i] && commands[cur[i].y].cond != commands[i].add0 && cur[i].y == j)
			{
				cur[i].x = add(cur[i].x, cur[j].x);
				cur[i].y = cur[j].y;
			}
	}
	int ans = 0;
	int step = 0;
	forn(i, 1024)
	{
		if(commands[step].cond == -1)
			break;
		ans = add(ans, cur[step].x);
		step = cur[step].y;
	}
	if(commands[step].cond == -1)
		return add(ans, 1);
	else
		return -1;
}

void solve()
{
	int ans = -1;
	forn(i, 300)
	{
		vector<int> p(n);
		iota(p.begin(), p.end(), 0);
		shuffle(p.begin(), p.end(), rnd);
		int cur = solve_one(p);
		if(cur != -1) ans = cur;
	}
	cout << ans << endl;
}

int main(){
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
#endif
	cin.tie(0);
	ios::sync_with_stdio(false);
	int tc = 1;
	// cin >> tc;
	while(tc > 0)
	{
		--tc;
		read();
		solve();
	}
}