#include"bits/stdc++.h"

using namespace std;

const int N = 1e6 + 10;

struct dream {
	int r, t;
	dream() {r = 0, t = 1;} 
	void add(int v) {
		r += v;
		r %= 256;
		t++;
	}
	void beq(int v, int k) {
		if(r == v) t = k;
		else t++;	
	}
	void bne(int v, int k) {
		if(r != v) t = k;
		else t++;
	}
	void blt(int v, int k) {
		if(r < v) t = k;
		else t++;
	}
	void bgt(int v, int k) {
		if(r > v) t = k;
		else t++;
	}
};

struct problem {
	string op;
	int v, k;
}p[N];

void solve() {
	int n;
	dream a;
	cin >> n;
	map<pair<int,int>,int> mp;
	for(int i = 1; i <= n; i++) {
		cin >> p[i].op >> p[i].v;
		if(p[i].op != "add") cin >> p[i].k;
	}
	while(a.t <= n) {
		//cout << a.r << " " << a.t << "\n";
		string op;
		int v, k;
		op = p[a.t].op, v = p[a.t].v, k = p[a.t].k;
		if(op == "add") {
			a.add(v); 
		}
		else if(op == "beq") {
			a.beq(v, k);
		}
		else if(op == "bne") {
			a.bne(v, k);
		}
		else {
			a.bgt(v, k);
		}
		if(!mp[{a.r, a.t}]) mp[{a.r, a.t}] = 1;
		else {
			cout << "No" << "\n";
			return ;
		}
	}
	cout << "Yes" << "\n";
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int t;
	cin >> t;
	while(t--) solve();
	return 0;
}
/*
4
2
add 1
blt 5 1
3
add 252
add 1
bgt 252 2
2
add 2
bne 7 1
3
add 1
bne 252 1
beq 252 1
*/