#include <stdio.h>
#include <array>
#include <random>
#include <queue>
std::mt19937_64 rng(0x3d03d);
#include <math.h>
#include <time.h>
#include <assert.h>
#include <string.h>
#include <algorithm>
#include <vector>
#include <set>
#define ld(x) printf("%lld\n",x)
#define int long long
using std::vector;
using vi=vector<int>;
using pi=std::pair<int,int>;
using vpi=vector<pi>;
#define x first
#define y second
inline int min(int a,int b){return a>b?b:a;}
inline int max(int a,int b){return a<b?b:a;}
inline int read()
{
    int num=0,f=1;char c=getchar();
    while(c<48||c>57){if(c=='-')f=-1;c=getchar();}
    while(c>47&&c<58)num=num*10+(c^48),c=getchar();
    return num*f;
}
int cmd[1000005],val[1000005],to[1000005];
bool g[100005][256];
signed main()
{
    int T=read();while(T--)
    {
    	int n=read();
    	for(int i=1;i<=n;i++)
    	{
    		memset(g[i],0,sizeof(g));
    		char s[9];scanf("%s",s);
    		if(s[0]=='a')cmd[i]='a',val[i]=read();
    		else cmd[i]=s[1],val[i]=read(),to[i]=read();
    	}
    	int C=1,D=0;
    	while(1)
    	{
    		if(C==n+1)goto yes;
    		if(g[C][D])goto no;
    		g[C][D]=1;
    		if(cmd[C]=='a')D=(D+val[C])%256,C++;
    		else if(cmd[C]=='g')C=(D>val[C])?to[C]:C+1;
    		else if(cmd[C]=='l')C=(D<val[C])?to[C]:C+1;
    		else if(cmd[C]=='e')C=(D==val[C])?to[C]:C+1;
    		else if(cmd[C]=='n')C=(D!=val[C])?to[C]:C+1;
    	}
    	
    	yes:puts("Yes");continue;
    	no:puts("No");
    }
	fprintf(stderr,"%.12lf\n",1.*clock()/CLOCKS_PER_SEC);
	return 0;
}