#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define fi first
#define se second
#define mkp make_pair
#define pb emplace_back
#define popcnt __builtin_popcountll
const int mod = 998244353;
inline ll read(){
	ll x=0, f=1; char ch=getchar();
	while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
	while(ch>='0' && ch<='9') x=x*10+ch-'0', ch=getchar();
	return x*f;
}
inline int lg2(int x){ return 31^__builtin_clz(x); }
inline ll lg2(ll x){ return 63^__builtin_clzll(x); }
inline ll qpow(ll a,ll b){
	ll ans=1, base=a;
	while(b){
		if(b&1) ans=ans*base%mod;
		base=base*base%mod; b>>=1;
	}
	return ans;
}
void init(){ }
int n; char s[55];
const int D = 1025;
int op[1500], a[1500], b[1500], c[1500], d[1500];
int dp[1500][1500], pp[1500][1500],sta[1500][1500];
bool vis[1500][1500];

void dfs(int i,int j){
	// cout<<"need "<<i<<" "<<j<<endl;
	if(sta[i][j] == 2) return;
	if(sta[i][j] == 1){
		puts("-1");
		exit(0);
	}

	sta[i][j] = 1;
	if(j == 0){
		dfs(d[i], c[i]);
		// cout<<"from "<<i<<","<<j<<" to "<<d[i]<<" "<<c[i]<<endl;
		dp[i][j] = (1 + dp[d[i]][c[i]]) % mod;
		pp[i][j] = pp[d[i]][c[i]];
	}else{
		// cout<<"from "<<i<<","<<j<<" to "<<i<<" "<<0<<endl;
		dfs(i, 0);
		int nxt=pp[i][0];
		// if(!nxt){
			// cout<<"here "<<d[i]<<" "<<0
		// }
		// cout<<"from "<<i<<","<<j<<" to "<<nxt<<" "<<j<<endl;
		dfs(nxt, j);
		dp[i][j] = (dp[i][0] + dp[nxt][j]) % mod;
		pp[i][j] = pp[nxt][j];
	}
	sta[i][j] = 2;
	// cout<<"here: "<<pp[i][j]<<endl;
	// cout<<"solved "<<i<<","<<j<<" with "<<dp[i][j]<<" "<<pp[i][j]<<endl;
}
void procedure(){
	n=read();
	for(int i=1;i<=n;i++){
		scanf("%s", s);
		if(s[0]=='H'){
			op[i]=0;
			c[i]=read(),d[i]=read();
		}else{
			op[i]=1;
			a[i]=read(),b[i]=read(),c[i]=read(),d[i]=read();
		}
	}

	// for(int i=1;i<=n;i++){
	// 	cout<<op[i]<<" "<<a[i]<<" "<<b[i]<<" "<<c[i]<<" "<<d[i]<<endl;
	// }

	for(int i=1;i<=n;i++){
		if(op[i]==0){
			sta[i][D] = 2;
			dp[i][D] = 1;
		}else{
			sta[i][a[i]] = 2;
			dp[i][a[i]] = 1;
			pp[i][a[i]] = b[i];
			// cout<<"solved "<<i<<","<<a[i]<<" = "<<b[i]<<endl;
		}
	}
	dfs(1, D);
	printf("%d\n", dp[1][D]);
}
int main(){
	#ifdef LOCAL
		assert(freopen("input.txt","r",stdin));
		assert(freopen("output.txt","w",stdout));
	#endif
	ll T=1;
	init();
	while(T--) procedure();
	return 0;
}