#ifndef LOCAL
#define FAST_IO
#endif

// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32) (n); ++i)
#define REP3(i, m, n) for (i32 i = (i32) (m); i < (i32) (n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32) (n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = __uint128_t;
using i32 = signed int;
using i64 = signed long long;
using i128 = __int128_t;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64) x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64) x;
    return os;
}

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ============

#ifdef DEBUGF
#else
#define DBG(x) (void) 0
#endif

Vec<i32> intersection(const Vec<i32> &a, const Vec<i32> &b) {
    Vec<i32> c;
    auto it = a.begin();
    for (i32 ele : b) {
        while (it != a.end() && *it < ele) {
            ++it;
        }
        if (it != a.end() && *it == ele) {
            c.push_back(ele);
        }
    }
    return c;
}

bool check(i32 n, const array<Vec<i32>, 3> &nums) {
    if (nums[2].empty()) {
        if (nums[1].empty()) {
            return true;
        }
        return !intersection(nums[0], nums[1]).empty();
    }
    if (nums[0].empty()) {
        return false;
    }
    if (nums[1].empty()) {
        return false;
    }
    Vec<i32> ab(n, 0), bc(n, 0);
    for (i32 ele : intersection(nums[0], nums[1])) {
        ab[ele] = 1;
    }
    for (i32 ele : intersection(nums[1], nums[2])) {
        bc[ele] = 1;
    }
    i32 abc = accumulate(ALL(ab), 0);
    i32 bcc = accumulate(ALL(bc), 0);
    if (abc == 0 || bcc == 0) {
        return false;
    }
    if (nums[1].size() == 1) {
        return true;
    }
    if (abc == 1 && bcc == 1) {
        REP(i, n) {
            if (ab[i] && bc[i]) {
                return false;
            }
        }
    }
    return true;
}

void solve() {
    i32 n;
    cin >> n;
    array<Vec<i32>, 3> nums;
    REP(i, n) {
        char c;
        i32 d;
        cin >> c >> d;
        --d;
        if (c == 'R') {
            nums[0].push_back(d);
        } else if (c == 'G') {
            nums[1].push_back(d);
        } else {
            nums[2].push_back(d);
        }
    }
    REP(i, 3) {
        sort(ALL(nums[i]));
    }
    Vec<i32> p(3);
    iota(ALL(p), 0);
    do {
        array<Vec<i32>, 3> nums_;
        REP(i, 3) {
            nums_[i] = nums[p[i]];
        }
        if (check(n, nums_)) {
            cout << "YES\n";
            return;
        }
    } while (next_permutation(ALL(p)));
    cout << "NO\n";
}

int main() {
    i32 t;
    cin >> t;
    REP(ti, t) {
        solve();
    }
}