#include <iostream>
#include <vector>
#include <algorithm>
#include <set>

using namespace std;

void solve()
{
  int n;
  cin >> n;
  vector<int> x(2 * n), y(2 * n);
  vector<char> c(2 * n);
  for (int i = 0; i < 2 * n; ++i) cin >> x[i] >> y[i] >> c[i];
  set<int> sx, sy;
  for (int i = 0; i < 2 * n; ++i)
  {
    if (c[i] == 'x')
    {
      sy.insert(y[i]);
    }
    else if (c[i] == 'y')
    {
      sx.insert(x[i]);
    }
  }
  int ans = (sx.size() <= n && sy.size() <= n);
  cout << (ans ? "Yes" : "No") << endl;
}

int main()
{
  int t;
  cin >> t;
  while (t--) solve(); 
}