#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e4+5,M=N*20+5,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
int n,op[N],v[N],k[N],f[N][256];string s;
void init(){
	int i,j;
}
int dfs(int x,int w){
	// cerr<<x<<' '<<v[x]<<' '<<w<<'\n';
	if(x==n+1) return 1;if(f[x][w]) return 0;
	f[x][w]=1;
	if(op[x]==1) return dfs(x+1,(w+v[x])%256);
	else if(op[x]==2) return w==v[x]?dfs(k[x],w):dfs(x+1,w);
	else if(op[x]==3) return w^v[x]?dfs(k[x],w):dfs(x+1,w);
	else if(op[x]==4) return w<v[x]?dfs(k[x],w):dfs(x+1,w);
	else return w>v[x]?dfs(k[x],w):dfs(x+1,w);
}
void Solve(){
	int i,j;scanf("%d",&n);
	for(i=1;i<=n;i++){
		cin>>s;
		if(s=="add") op[i]=1,scanf("%d",&v[i]);
		else if(s=="beq") op[i]=2,scanf("%d%d",&v[i],&k[i]);
		else if(s=="bne") op[i]=3,scanf("%d%d",&v[i],&k[i]);
		else if(s=="blt") op[i]=4,scanf("%d%d",&v[i],&k[i]);
		else op[i]=5,scanf("%d%d",&v[i],&k[i]);
	}
	for(i=1;i<=n;i++) Me(f,0);
	puts(dfs(1,0)?"Yes":"No");
}
int main(){
	int t;init();
	scanf("%d",&t);
	// t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}