#include <bits/stdc++.h>
using namespace std;
using ll = long long;

struct dsu {
    public:
    int csz;
    dsu() : _n(0) {}
    dsu(int n) : _n(n), csz(n), parent_or_size(n, -1) {}

    int merge(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        int x = leader(a), y = leader(b);
        if (x == y) return x;
        if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
        csz--;
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        return x;
    }

    bool same(int a, int b) {
        assert(0 <= a && a < _n);
        assert(0 <= b && b < _n);
        return leader(a) == leader(b);
    }

    int leader(int a) {
        assert(0 <= a && a < _n);
        if (parent_or_size[a] < 0) return a;
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    int size(int a) {
        assert(0 <= a && a < _n);
        return -parent_or_size[leader(a)];
    }

    std::vector<std::vector<int>> groups() {
        std::vector<int> leader_buf(_n), group_size(_n);
        for (int i = 0; i < _n; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        std::vector<std::vector<int>> result(_n);
        for (int i = 0; i < _n; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < _n; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            std::remove_if(result.begin(), result.end(),
                           [&](const std::vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }

    private:
    int _n;
    // root node: -1 * component size
    // otherwise: parent
    std::vector<int> parent_or_size;
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T, N;
    cin >> T;
    auto f = [&](char c){
        if(c == 'R')return 0;
        if(c == 'G')return 1;
        return 2;
    };
    while(T--){
        cin >> N;
        vector<int> cnt(N), tb(3), idx(N, -1), idx2(3, -1), S(N);
        char c;
        int v;
        vector<pair<char,int>> a(N);
        dsu uf(N);
        for(int i = 0; i < N; i++){
            cin >> c >> v;
            v--;
            a[i] = {c, v};
            tb[f(c)]++;
            cnt[v]++;
            if(idx[v] != -1)uf.merge(idx[v], i);
            if(idx2[f(c)] != -1)uf.merge(idx2[f(c)], i);
            idx[v] = i;
            idx2[f(c)] = i;
            S[v] |= 1 << f(c);
        }
        if(N == 1){
            cout << "YES" << '\n';
            continue;
        }
        if(uf.size(0) != N){
            cout << "NO" << '\n';
            continue;
        }
        if(count(idx2.begin(), idx2.end(), -1) == 2){
            cout << "YES" << '\n';
            continue;
        }
        if(count(idx2.begin(), idx2.end(), -1) == 1){
            cout << (count(cnt.begin(), cnt.end(), 2) >= 1 ? "YES" : "NO") << '\n';
            continue;
        }
        bool ans = false;
        vector<int> s = {0b011, 0b110, 0b101};
        vector<vector<int>> idx3(3);
        for(int i = 0; i < N; i++){
            for(int j = 0; j < 3; j++){
                if((S[i] & s[j]) == s[j]){
                    idx3[j].push_back(i);
                }
            }
        }
        for(int i = 0; i < 3; i++){
            int i2 = (i + 1) % 3;
            for(int j = 0; j < idx3[i].size() && !ans; j++){
                for(int k = 0; k < idx3[i2].size() && !ans; k++){
                    if(idx3[i][j] != idx3[i2][k])ans = true;
                    else{
                        int S2 = s[i] & s[i2];
                        for(int l = 0; l < 3; l++){
                            if(S2 >> l & 1){
                                if(tb[l] == 1){
                                    ans = true;
                                    break;
                                }
                            }
                        }
                    }
                }
            }
        }
        cout << (ans ? "YES" : "NO") << '\n';
    }
}