import itertools
import sys
from collections import deque, Counter
sys.setrecursionlimit(5 * 10 ** 5)
from pypyjit import set_param
set_param('max_unroll_recursion=-1')
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353

def solve():
    n = ii()
    D = {}
    D['R'] = set()
    D['G'] = set()
    D['B'] = set()
    for _ in range(n):
        c, d = input().split()
        d = int(d)
        D[c].add(d)
    ans = 'NO'
    for v in itertools.permutations('RGB'):
        if not D[v[1]] and not D[v[2]]:
            ans = 'YES'
        if not D[v[2]] and D[v[0]] & D[v[1]]:
            ans = 'YES'
        if D[v[0]] & D[v[1]]:
            P = D[v[0]] & D[v[1]]
            x = P.pop()
            Q = D[v[1]] & D[v[2]]
            Q.discard(x)
            if Q:
                ans = 'YES'
        if len(D[v[1]]) == 1:
            if D[v[0]] & D[v[1]] & D[v[2]]:
                ans = 'YES'
    print(ans)

for _ in range(ii()):
    solve()