// created:  2024-11-20 20:50:44
#include<cstdio>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#define F(i,l,r) for(int i=(l),i##_end=(r);i<i##_end;++i)
#define I128 //||is_same<T,__int128_t>::value||is_same<T,__uint128_t>::value
using namespace std;
template<typename T>enable_if_t<is_integral<T>::value I128,void> readmain(T &x)
{
	bool neg=false;int c=getchar();
	for(;!isdigit(c);c=getchar())if(c=='-')neg=true;
	for(x=0;isdigit(c);c=getchar())x=(T)(10*x+(c-'0'));
	if(neg)x=-x;
}
template<typename T>T& read(T &x){readmain(x);return x;}
template<typename T,typename ...Tr>void read(T &x,Tr&... r){readmain(x);read(r...);}
constexpr int N=1027,MOD=998244353;
void reduce(int &x){if(x>=MOD)x-=MOD;}
int n,a[N],x[N],b[N],y[N],f[N][N][2];
bool ins[N][N],vis[N];
void dfs(int c,int z)
{
	if(~f[c][z][0])return;
	if(ins[c][z])
	{
		puts("-1");
		exit(0);
		return;
	}
	ins[c][z]=true;
	if(z!=a[c])
	{
		dfs(y[c],b[c]);
		int u=f[y[c]][b[c]][0];
		dfs(u,z);
		f[c][z][0]=f[u][z][0];
		reduce(f[c][z][1]=f[y[c]][b[c]][1]+f[u][z][1]);
	}
	else f[c][z][0]=x[c],f[c][z][1]=1;
	ins[c][z]=false;
}
int main()
{
	read(n);
	F(i,0,n)
	{
		char c;scanf(" %c",&c);
		if(c=='H')read(b[i],y[i]),--y[i];
		else read(a[i],x[i],b[i],y[i]),--x[i],--y[i];
	}
	F(i,0,n)F(j,1,1025)f[i][j][0]=-1;
	int ans=0,u=0;
	while(a[u])
	{
		if(vis[u])return puts("-1"),0;
		vis[u]=true;
		dfs(y[u],b[u]);
		reduce(ans+=f[y[u]][b[u]][1]);
		u=f[y[u]][b[u]][0];
	}
	reduce((ans<<=1)|=1);
	printf("%d\n",ans);
	return 0;
}