#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

bool solve() {
  int n;
  cin >> n;
  VI d[3];
  rep(_, n) {
    char c;
    int di;
    cin >> c >> di;
    di--;
    int col = c == 'B' ? 0 : c == 'G' ? 1 : 2;
    d[col].emplace_back(di);
  }
  sort(all(d), [](const VI& x, const VI& y) { return x.size() > y.size(); });
  VI exist(n);
  rep(i, 3) for(int x: d[i]) exist[x] |= 1 << i;
  if (d[2].empty()) {
    if (d[1].empty()) return true;
    rep(i, n) if (exist[i] == 3) return true;
    return false;
  }
  if (d[2].size() == 1) {
    if (d[1].size() == 1) {
      if (d[0].size() == 1) return exist[d[0][0]] == 7;
      return find(all(d[0]), d[1][0]) != d[0].end() &&
             find(all(d[0]), d[2][0]) != d[0].end();
    }
    rep(i, n) if (exist[i] == 7) return true;
    bool ok = false;
    rep(i, n) if (exist[i] >> 2 & 1 && exist[i] != 4) {
      ok = true;
      exist[i] = 0;
      break;
    }
    if (!ok) return false;
    rep(i, n) if (exist[i] == 3) return true;
    return false;
  }
  int conn = 0;
  int es = 0;
  rep(i, n) {
    if (__builtin_popcount(exist[i]) >= 2) {
      es++;
      if ((exist[i] & 3) == 3) conn |= 1;
      if ((exist[i] & 5) == 5) conn |= 2;
      if ((exist[i] & 6) == 6) conn |= 4;
    }
  }
  return __builtin_popcount(conn) >= 2 && es >= 2;
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while(tt--) cout << (solve() ? "YES\n" : "NO\n");
}