#include <bits/stdc++.h>
#define cerr cout << "in " << __LINE__ << "\t: "
using namespace std;
const int mod = 998244353;
struct mint {
	int x;
	mint() : x(0) {}
	mint(long long y, bool flag = 0) {
		if (flag) x = y;
		else x = (y % mod + mod) % mod;
	}
	friend const mint ksm(mint a, long long b);
	const mint inv() {return ksm(*this, mod - 2);}
};
bool operator == (const mint a, const mint b) {return a.x == b.x;}
bool operator != (const mint a, const mint b) {return a.x != b.x;}
bool operator < (const mint a, const mint b) {return a.x < b.x;}
int operator ! (const mint a) {return !a.x;}
const mint operator + (const mint a, const mint b) {
	mint res(a.x + b.x, 1);
	if (res.x >= mod) res.x -= mod;
	return res;
}
mint& operator += (mint &a, const mint b) {
	a.x += b.x;
	if (a.x >= mod) a.x -= mod;
	return a;
}
const mint operator - (const mint a, const mint b) {
	mint res(a.x - b.x, 1);
	if (res.x < 0) res.x += mod;
	return res;
}
mint& operator -= (mint &a, const mint b) {
	a.x -= b.x;
	if (a.x < 0) a.x += mod;
	return a;
}
const mint operator * (const mint a, const mint b) {
	return mint((long long)a.x * b.x % mod, 1);
}
mint& operator *= (mint &a, const mint b) {
	a.x = (long long)a.x * b.x % mod;
	return a;
}
const mint ksm(mint a, long long b) {
	mint res(1, 1);
	for (; b; a *= a, b >>= 1)
		if (b & 1) res *= a;
	return res;
}
const mint operator / (const mint a, const mint b) {
	return a * ksm(b, mod - 2);
}
mint& operator /= (mint &a, const mint b) {
	a = a * ksm(b, mod - 2);
	return a;
}
ostream& operator << (ostream &out, const mint a) {
	return out << a.x;
}
istream& operator >> (istream &in, mint &a) {
	long long y;
	in >> y, a = mint(y);
	return in;
}
int n, a[1100][4], vis[1100], in[1100];
pair<mint, int> f[1100];
pair<mint, int> solve(int now) {
	if (in[now]) {
		cout << -1 << "\n";
		exit(0);
	}
	if (vis[now]) return f[now];
	in[now] = vis[now] = 1, f[now].first = 2;
	int x = a[now][3];
	vector<int> tmp(n + 1);
	tmp[x] = 1;
	while (a[x][0] != a[now][2]) {
		auto res = solve(x);
		f[now].first += res.first, x = res.second;
		if (tmp[x]) {
			cout << -1 << "\n";
			exit(0);
		}
		tmp[x] = 1;
	}
	f[now].second = a[x][1], in[now] = 0;
	return f[now];
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		string str;
		cin >> str;
		if (str[0] == 'H') {
			cin >> str;
			cin >> a[i][2];
			cin >> str;
			cin >> a[i][3];
			a[i][0] = 0, a[i][1] = 0;
		}
		else {
			cin >> a[i][0];
			cin >> str;
			cin >> str;
			stringstream tt(str.substr(0, str.size() - 1));
			tt >> a[i][1];
			cin >> str;
			cin >> a[i][2];
			cin >> str;
			cin >> a[i][3];
		}
	}
	a[0][0] = 0, a[0][1] = 0, a[0][2] = 0, a[0][3] = 1;
	cout << solve(0).first - 1 << "\n";
	return 0;
}