#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <cstdio>
#include <queue>
#include <unordered_map>
#include <set>
#include <cmath>
#include <map>
#include <stack>
#include <sstream>
#include <random>
#include <ctime>
#include <chrono>
#define ios ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define TIME cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
#define debug(x) cerr << #x << " : " << x << '\n'
#define all(v) v.begin() , v.end()
// std::mt19937 rnd(std::chrono::system_clock::now().time_since_epoch().count());

#define x first
#define y second

using namespace std;

typedef long long LL;
typedef pair<int , int> PII;

const int N = 2e5 + 5;
const int INF = 0x3f3f3f3f;
const int mod = 998244353;

int read(){
    int x = 0 , f = 1;
    char c = getchar();
    while(c < '0' || c > '9'){
        if(c == '-')f = -1;
        c = getchar();
    }
    while(c >= '0' && c <= '9'){
        x = x * 10 + c - '0';
        c = getchar();
    }
    return x * f;
}

pair<string , PII> q[N];

void solve(){
    int n;
    cin >> n;
    for(int i = 1 ; i <= n ; i ++){
        string s;
        cin >> s;
        if(s == "add"){
            int x;
            cin >> x;
            q[i] = {s , {x , 0}};
        }else{
            int v , k;
            cin >> v >> k;
            q[i] = {s , {v , k}};
        }
    }
    int pos = 1 , cnt = 0 , val = 0;
    while(true){
        string s = q[pos].x;
        int a = q[pos].y.x , b = q[pos].y.y;
        if(s == "add"){
            pos ++;
            val = (val + a) % 256;
        }else if(s == "beq"){
            if(val == a)pos = b;
            else pos ++;
        }else if(s == "bne"){
            if(val != a)pos = b;
            else pos ++;
        }else if(s == "blt"){
            if(val < a)pos = b;
            else pos ++;
        }else{
            if(val > a)pos = b;
            else pos ++;
        }
        cnt ++;
        if(pos == n + 1)break;
        if(cnt >= cnt * 256)break;
    }
    if(pos == n + 1)puts("Yes");
    else puts("No");
}

int main(){
    int T;
    cin >> T;
    while(T --){
        solve();
    }
    return 0;
}
/* stuff you should look for
 * int overflow, array bounds
 * special cases (n=1?)
 * do smth instead of nothing and stay organized
 * WRITE STUFF DOWN
 * DON'T GET STUCK ON ONE APPROACH
 */