#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    int n;
    cin >> n;
    vector<string> op(n);
    vector<int> v(n), k(n);
    for (int i = 0; i < n; i++) {
      cin >> op[i] >> v[i];
      if (op[i][0] == 'b') {
        cin >> k[i];
        --k[i];
      }
    }
    int p = 0, val = 0;
    set<pair<int, int>> st;
    bool ok = true;
    while (p < n) {
      if (st.find({val, p}) != st.end()) {
        ok = false;
        break;
      }
      st.insert({val, p});
      if (op[p] == "add") {
        val = (val + v[p]) % 256;
        p += 1;
        continue;
      }
      if (op[p] == "beq") {
        if (val == v[p]) {
          p = k[p];
        } else {
          p += 1;
        }
        continue;
      }
      if (op[p] == "bne") {
        if (val != v[p]) {
          p = k[p];
        } else {
          p += 1;
        }
        continue;
      }
      if (op[p] == "blt") {
        if (val < v[p]) {
          p = k[p];
        } else {
          p += 1;
        }
        continue;
      }
      if (op[p] == "bgt") {
        if (val > v[p]) {
          p = k[p];
        } else {
          p += 1;
        }
        continue;
      }
    }
    cout << (ok ? "Yes" : "No") << '\n';
  }
  return 0;
}