#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t; cin >> t;
	while (t--) {
		int n; cin >> n;
		int cx = 0, cy = 0;
		map<int, int>sx, sy;
		rep(i, n * 2) {
			int x, y; cin >> x >> y;
			char c; cin >> c;
			if (c == 'x') {
				cx++;
				sx[y]++;
			}
			else {
				cy++;
				sy[x]++;
			}
		}
		int cx1 = 0;
		for (auto [k, v] : sx)if (v % 2)cx1++;
		int cy1 = 0;
		for (auto [k, v] : sy)if (v % 2)cy1++;
		//	cout << cx << "_" << cx1 << endl;
		//	cout << cx << "_" << cx1 << endl;
		if (cx1 < cy1) {
			cout << (cy1 <= cx ? "Yes" : "No") << endl;
		}
		else {
			cout << (cx1 <= cy ? "Yes" : "No") << endl;
		}
	}
	return 0;
}