#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll T;
    cin >> T;
    while (T--){
        ll N;
        cin >> N;
        vector<char> C(N);
        vector<ll> D(N);
        vector<vector<bool>> pos(N + 1, vector<bool>(3, false));
        for (ll i = 0; i < N; i++){
            cin >> C[i] >> D[i];
            if (C[i] == 'R'){
                pos[D[i]][0] = true;
            }
            else if (C[i] == 'G'){
                pos[D[i]][1] = true;
            }
            else{
                pos[D[i]][2] = true;
            }
        }
        bool rg = false;
        bool rb = false;
        bool gb = false;
        vector<bool> has(3, false);
        vector<ll> cnts(3, 0);
        ll cnt_3 = 0;
        ll cnt_2 = 0;
        for (ll i = 1; i <= N; i++){
            ll bits = 0;
            for (ll j = 0; j < 3; j++){
                if (pos[i][j]){
                    bits += (1 << j);
                    has[j] = true;
                    cnts[j]++;
                }
            }
            if (bits == 7){
                cnt_3++;
            }
            else if (bits == 3 || bits == 5 || bits == 6){
                cnt_2++;
            }
            if (bits == 3 || bits == 7){
                rg = true;
            }
            else if (bits == 5 || bits == 7){
                rb = true;
            }
            else if (bits == 6 || bits == 7){
                gb = true;
            }
        }
        if ((!has[1] && !has[2]) || (!has[0] && !has[2]) || (!has[0] && !has[1])){
            cout << "YES" << endl;
        }
        else if (!(has[0] && has[1] && has[2])){
            if (cnt_2 > 0){
                cout << "YES" << endl;
            }
            else{
                cout << "NO" << endl;
            }
        }
        else{
            if (cnt_3 == 1 && cnt_2 == 0){
                if (cnts[0] == 1 || cnts[1] == 1 || cnts[2] == 1){
                    cout << "YES" << endl;
                }
                else{
                    cout << "NO" << endl;
                }
            }
            else if ((rg && rb) || (rg && gb) || (rb && gb)){
                cout << "YES" << endl;
            }
            else{
                cout << "NO" << endl;
            }
        }
    }
}