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

using ll = long long;

void solve() {
    int n; cin >> n;

    vector<ll> xs, ys;
    for (int i=0; i<2*n; i++) {
        ll x, y; char c; cin >> x >> y >> c;
        if (c == 'x') ys.push_back(y);
        else xs.push_back(x);
    }
    sort(ys.begin(), ys.end());
    sort(xs.begin(), xs.end());

    auto f = [&](vector<ll>& x) -> int {
        int re = 0;
        int l = 0;
        while (l < ssize(x)) {
            int r = l;
            while (r<ssize(x) && x[l]==x[r]) r++;
            if ((r-l) % 2 == 1) re++;
            l = r;
        }
        return re;
    };

    cout << (f(ys)<=ssize(xs) && f(xs)<=ssize(ys) ? "Yes" : "No") << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T; cin >> T;
    while (T--) solve();
}