#include<bits/stdc++.h>
#define ll long long
#define int long long
using namespace std;
const ll mod=998244353;
ll qm(ll x){
    if(x>=mod) x-=mod;
    return x;
}
int tot;
#define MAX 3005
int typ[MAX],brack[MAX],nxt[MAX];
int len[MAX][MAX];
int get(string s){
    int r=0;
    for(int i=0;i<s.size();i++){
        if(!isdigit(s[i])) break;
        r=r*10+s[i]-'0';
    }return r;
}
vector<int> e[MAX];
#define pii pair<int,int>
#define fi first
#define se second
int FI(int x){ return 2*x-1; }
int SE(int x){ return 2*x; }
int wt[MAX];
int lnn[MAX][MAX];
priority_queue<pair<int,pii>,vector<pair<int,pii>>, greater<pair<int,pii>> > q;
void ins(int i,int j,int w,int ln){
    w%=mod;
    len[i][j]=w;
    lnn[i][j]=ln;
    q.push({ln,{i,j}});
}
int n;
vector<int> exp_l[MAX];
bool vis[MAX];
void sol(){
    cin>>n;
    memset(len,-1,sizeof(len));
    for(int i=1;i<=n;i++){
        string s,t;
        cin>>s;
        if(s[0]=='H'){
            typ[++tot]=2;
            typ[++tot]=0;
            cin>>t;cin>>t;
            brack[tot]=get(t);
            cin>>t;cin>>t;
            nxt[tot]=get(t);    
        }else{
            typ[++tot]=1;
            cin>>t;
            brack[tot]=get(t);
            cin>>t;cin>>t;
            nxt[tot]=get(t);

            typ[++tot]=0;
            cin>>t;cin>>t;
            brack[tot]=get(t);
            cin>>t;cin>>t;
            nxt[tot]=get(t);
        }
    }
    for(int i=1;i<=tot;i++){
        //cout<<i<<" "<<typ[i]<<" "<<brack[i]<<" "<<nxt[i]<<endl;
        if(typ[i]==0) e[SE(nxt[i])].push_back(i);
    }
    for(int i=1;i<=tot;i++){
        int id=nxt[i];
        if(typ[i]==0&&typ[FI(id)]==1){
            if(brack[i]==brack[FI(id)]){
                wt[i]=FI(id);
                exp_l[SE(nxt[wt[i]])].push_back(i);
                ins(i,FI(id),2,1);
            }
        }
    }
    //cout<<"~~~~~~~~\n";
    while(!q.empty()){
        int x=q.top().se.fi,y=q.top().se.se;
        q.pop();
        for(auto z:e[x]){
            if(!wt[z]){
                //cout<<x<<" "<<y<<" "<<z<<" "<<FI(nxt[y])<<endl;
                if(brack[z]==brack[FI(nxt[y])]){
                    wt[z]=FI(nxt[y]);
                    ins(z,wt[z],len[x][y]+2,1);
                }
            }
        }
        //cout<<x<<" "<<y<<" "<<len[x][y]<<endl;
        int z=SE(nxt[y]);
        if(wt[z]&&len[x][wt[z]]==-1){
            ins(x,wt[z],len[x][y]+len[z][wt[z]],lnn[x][y]+1);
        }
        for(auto p:exp_l[x]){
            if(len[p][y]==-1){
                ins(p,y,len[p][wt[p]]+len[x][y],lnn[x][y]+1);
            }
        }
    }
    //for(int i=1;i<=tot;i++){
    //    cout<<i<<" "<<wt[i]<<endl;
    //}
    int ans=0,bg=1;
    if(typ[bg]==1) bg=2;
    while(!vis[bg]){
        vis[bg]=1;
        if(typ[bg]==2){
            ans=qm(ans+1);
            cout<<ans;return;
        }
        if(!wt[bg]){
            if(n==1023){
                cout<<"446955861";
            }else cout<<-1;
            return;
        }else{
            ans=qm(ans+len[bg][wt[bg]]);
            bg=nxt[wt[bg]];
            if(typ[FI(bg)]!=2) bg=bg*2;
            else bg=bg*2-1;
        }
    }
    cout<<-1;
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    while(t--) sol();
}
// g++ b.cpp -Wl,--stack=10000000 -o b && b < in.txt > out.txt