#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define ll long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define repl(i,a,b) for(ll i=(a);i<(b);i++)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

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


void solve(){
  int n; cin >> n;
  vector<int> x(2*n),y(2*n);
  vector<char> c(2*n);
  int cntx=0,cnty=0;
  rep(i,0,2*n){
    cin >> x[i] >> y[i] >> c[i];
    if(c[i] == 'x') cntx++;
    else cnty++;
  }
  if(cntx<cnty){
    swap(cntx,cnty);
    swap(x,y);
    rep(i,0,2*n){
      if(c[i] == 'x') c[i]='y';
      else c[i]='x';
    }
  }
  map<int,int> mp;
  rep(i,0,2*n)if(c[i] == 'x')mp[y[i]]++;
  int sum=0;
  for(auto [key,val]:mp) sum+=val/2*2;
  if(sum>=cntx-cnty) cout << "Yes\n";
  else cout << "No\n";

  return;
}
  
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int T=1;
  cin >> T;
  rep(_,0,T){
    solve();
  }
}