#include <bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;

#define mod 998244353
struct modint{
	unsigned int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x<o.x?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,modint b){return a.x==b.x;}
	friend bool operator !=(modint a,modint b){return a.x!=b.x;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}


#define maxn 1044

int n;
int a[maxn],b[maxn],x[maxn],y[maxn];

modint f[maxn][maxn];
int to[maxn][maxn];
int vis[maxn][maxn];

void dfs(int u,int v){
	if(vis[u][v]==1) {puts("-1");exit(0);}
	if(vis[u][v]==-1) return;
	vis[u][v]=1;

	if(v==a[u]){
		f[u][v]=1; to[u][v]=x[u];
		vis[u][v]=-1; return;
	}
	
	modint res=1;
	dfs(y[u],b[u]);
	if(to[y[u]][b[u]]==0) {
		f[u][v]=f[y[u]][b[u]]+1;
		to[u][v]=0;
		vis[u][v]=-1; return;
	}

	int z=to[y[u]][b[u]];
	dfs(z,v);
	f[u][v]=f[y[u]][b[u]]+f[z][v]+1;
	to[u][v]=to[z][v];
	vis[u][v]=-1; return;
}

void work()
{
    cin>>n;
    For(i,1,n){
        string s;cin>>s;
        if(s[0]=='H'){
            a[i]=x[i]=0;
        }else{
            cin>>a[i]>>s;
            scanf("%d;",&x[i]);
        }
        cin>>s>>b[i];
        cin>>s>>y[i];
    }
	dfs(1,0);
	cout<<f[1][0].x<<"\n";
}

int main()
{
	work();
    return 0;
}