/**
 *  - Meet Brahmbhatt
 *  - Hard work always pays off
**/
#include"bits/stdc++.h"
using namespace std;

#ifdef MeetBrahmbhatt
#include "debug.h"
#else
#define dbg(...) 72
#endif

#define endl "\n"
#define int long long

const long long INF = 4e18;

const int LOG = 256;

void solve() {
    int n;
    cin >> n;
    vector<string> t(n);
    vector<array<int, 2>> val(n);
    for (int i = 0; i < n; i++) {
        cin >> t[i];
        int x;
        cin >> x;
        if (t[i] == "add") {
            val[i] = {x, -1};
        } else {
            int y;
            cin >> y;
            val[i] = {x, y - 1};
        }
    }
    vector<vector<bool>> v(n + 1, vector<bool>(LOG));
    function<bool(int, int)> F = [&] (int id, int r) {
        if (id == n) {
            return true;
        }
        if (v[id][r]) {
            return false;
        }
        v[id][r] = 1;
        if (t[id] == "add") {
            return F(id + 1, (r + val[id][0]) % LOG);
        } else if (t[id] == "beq") {
            if (r == val[id][0]) {
                return F(val[id][1], r);
            } else {
                return F(id + 1, r);
            }
        } else if (t[id] == "bne") {
            if (r != val[id][0]) {
                return F(val[id][1], r);
            } else {
                return F(id + 1, r);
            }
        } else if (t[id] == "blt") {
            if (r < val[id][0]) {
                return F(val[id][1], r);
            } else {
                return F(id + 1, r);
            }
        } else {
            if (r > val[id][0]) {
                return F(val[id][1], r);
            } else {
                return F(id + 1, r);
            }
        }
    };
    cout << (F(0, 0) ? "Yes" : "No") << endl;
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(9);
    int tt = 1;
    cin >> tt;
    while (tt--) solve();
    return 0;
}