/* -*- coding: utf-8 -*-
 *
 * 2148.cc:  No.2148 ひとりUNO - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
enum { B, G, R };

/* typedef */

typedef pair<int,int> pii;

/* global variables */

int e0[3][3], e1[3][3], cls[3];
pii ps[MAX_N];

/* subroutines */

inline int c2i(char c) {
  return (c == 'B') ? B : (c == 'G') ? G : (c == 'R') ? R : -1;
}

/* main */

int main() {
  int tn;
  scanf("%d", &tn);

  while (tn--) {
    int n;
    scanf("%d", &n);

    for (int i = 0; i < 3; i++) fill(e0[i], e0[i] + 3, 0);
    for (int i = 0; i < 3; i++) fill(e1[i], e1[i] + 3, 0);
    fill(cls, cls + 3, 0);
    int cn = 0;

    for (int i = 0; i < n; i++) {
      char s[4];
      int di;
      scanf("%s%d", s, &di);
      int ci = c2i(s[0]);
      ps[i] = pii(di, ci);
      if (! cls[ci]) cn++;
      cls[ci]++;
    }
    sort(ps, ps + n);

    for (int i = 0; i < n;) {
      int i0 = i;
      while (i < n && ps[i0].first == ps[i].first) i++;

      if (i - i0 > 1)
	for (int j0 = i0; j0 < i; j0++)
	  for (int j1 = j0 + 1; j1 < i; j1++) {
	    int c0 = ps[j0].second, c1 = ps[j1].second;
	    if (! e0[c0][c1])
	      e0[c0][c1] = e0[c1][c0] = ps[i0].first;
	    else if (! e1[c0][c1])
	      e1[c0][c1] = e1[c1][c0] = ps[i0].first;
	  }
    }

    //for (int i = 0; i < 3; i++) {
    //for (int j = 0; j < 3; j++) printf("%d,%d ", e0[i][j], e1[i][j]);
    //putchar('\n');
    //}

    bool ok = false;
    if (cn == 1)
      ok = true;
    else if (cn == 2) {
      int c0 = -1, c1 = -1;
      for (int i = 0; i < 3; i++)
	if (cls[i]) {
	  if (c0 < 0) c0 = i;
	  else c1 = i;
	}

      ok = (e0[c0][c1] > 0);
    }
    else {
      for (int c0 = 0; ! ok && c0 < 3; c0++) {
	int c1 = (c0 + 1) % 3, c2 = (c0 + 2) % 3;
	int e01 = e0[c0][c1], e11 = e1[c0][c1];
	int e02 = e0[c0][c2], e12 = e1[c0][c2];
	if (cls[c0] == 1 && e01 && e02)
	  ok = true;
	else if (cls[c0] > 1 &&
		 ((e01 && e02 && e01 != e02) ||
		  (e01 && e12 && e01 != e12) ||
		  (e11 && e02 && e11 != e02) ||
		  (e11 && e12 && e11 != e12)))
	  ok = true;
      }
    }

    if (ok) puts("YES");
    else puts("NO");
  }
  return 0;
}