#include<bits/stdc++.h>
#define ll long long
#define maxn 2005
#define maxm 1000005
using namespace std;

const int N=1000000;
const ll mod=998244353;
struct intruction
{
	int op;
	int x1,y1;
	int x2,y2;
	int jmp;
	ll val;
	intruction()
	{
		op=x1=y1=x2=y2=jmp=0;
		val=0;
	}
}ins[maxn];
int n;
int vis[maxn];
pair<int,ll>stk[maxm];

void print(int m)
{
	printf("op=%d ",ins[m].op);
	if(ins[m].op==1)
	printf("x1=%d y1=%d x2=%d y2=%d\n",ins[m].x1,ins[m].y1,ins[m].x2,ins[m].y2);
	else
	printf("x2=%d y2=%d\n",ins[m].x2,ins[m].y2);
}

std::string getword(std::string s,int n,int &p)
{
	std::string ret;
	while(p<n&&(s[p]<'A'||s[p]>'Z')&&(s[p]<'0'||s[p]>'9'))
	p++;
	while(p<n&&s[p]!=' '&&s[p]!=';'&&s[p]!='\n'&&s[p]!=EOF)
	ret.push_back(s[p++]);
	p++;
	return ret;
}

void read(int m)
{
	int num=0;
	std::string s,t;
	std::getline(cin,s);
	while(s[0]<'A'||s[0]>'Z')
	std::getline(cin,s);
	int n=s.size(),p=0;
	while(p<n)
	{
		num++;
		t=getword(s,n,p);
		if(num==1)
		{
			if(t[0]=='P')
			ins[m].op=1;
			else ins[m].op=2;
		}
		else if(ins[m].op==1)
		{
			if(num==2)
			ins[m].x1=stoi(t);
			if(num==4)
			ins[m].y1=stoi(t);
			if(num==6)
			ins[m].x2=stoi(t);
			if(num==8)
			ins[m].y2=stoi(t);
		}
		else if(ins[m].op==2)
		{
			if(num==3)
			ins[m].x2=stoi(t);
			if(num==5)
			ins[m].y2=stoi(t);
		}
	}
}

ll Push(int &top,int &p)
{
	ll ret=0;
	if(ins[p].jmp)
	{
		if(!top)
		ret=ins[p].val;
		else
		stk[top].second=(stk[top].second+ins[p].val)%mod;
		p=ins[p].jmp;
	}
	else
	{
		vis[p]=1;
		stk[++top]={p,1};
		p=ins[p].y2;
	}
	return ret;
}

ll Pop(int &top,int &p)
{
	vis[p]=0;
	ll ret=0;
	ins[stk[top].first].jmp=p=ins[p].y1;
	ins[stk[top].first].val=ret=(stk[top].second+1)%mod;
	top--;
	if(top)
	{
		stk[top].second=(stk[top].second+ret)%mod;
		ret=0;
	}
	return ret;
}

void solve()
{
	int top=0,p=1,lst[2]={0,0};
	ll ans=0;
	while(1)
	{
		if(ins[p].y1==p&&ins[p].y2==p)
		{
			printf("-1");
			return;
		}
		if(top>N)
		{
			printf("-1");
			return;
		}
		switch (ins[p].op)
		{
			case 1:
			{
				if(!top||ins[stk[top].first].x2!=ins[p].x1)
				ans=(ans+Push(top,p))%mod;
				else//pop
				ans=(ans+Pop(top,p))%mod;
				break;
			}
			case 2:
			{
				if(!top)
				{
					ans++;
					printf("%lld",ans);
					return;
				}
				else
				ans=(ans+Push(top,p))%mod;
				break;
			}
		}
	}
}

int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;++i)
	read(i);
//	for(int i=1;i<=n;++i)
//	print(i);
	solve();
	return 0;
}