#include <bits/stdc++.h>

void solve() {
  int n;
  std::cin >> n;
  std::vector<std::pair<int, std::pair<int, int>>> a(n + 1);
  std::string s;
  int v;
  for (int i = 1; i <= n; ++i) {
    std::cin >> s >> v;
    if (s[0] == 'a') a[i].first = 1, a[i].second.first = v;
    else {
      int k;
      std::cin >> k;
      if (s[1] == 'e') a[i].first = 2, a[i].second = {v, k};
      if (s[1] == 'n') a[i].first = 3, a[i].second = {v, k};
      if (s[1] == 'l') a[i].first = 4, a[i].second = {v, k};
      if (s[1] == 'g') a[i].first = 5, a[i].second = {v, k};
    }
  }
  int r = 0;
  std::map<std::pair<int, int>, bool> mp;
  for (int i = 1; i <= n;) {
    if (mp[{i, r}]) {
      std::cout << "No\n";
      return;
    }
    mp[{i, r}] = true;
    if (a[i].first == 1) {
      r = (r + a[i].second.first) % 256;
      i ++;
    } else if (a[i].first == 2) {
      if (r == a[i].second.first) i = a[i].second.second;
      else i = i + 1;
    } else if (a[i].first == 3) {
      if (r == a[i].second.first) i = i + 1;
      else i = a[i].second.second;
    } else if (a[i].first == 4) {
      if (r < a[i].second.first) i = a[i].second.second;
      else i = i + 1;
    } else if (a[i].first == 5) {
      if (r > a[i].second.first) i = a[i].second.second;
      else i = i + 1;
    }
  }
  std::cout << "Yes\n";
}

signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  int _(1);
  std::cin >> _;
  while (_ --) solve();
  return 0;
}