#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
// disable assert
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
const ll INF = 1ll << 60;
#define REP(i,n) for(ll i=0; i<ll(n); i++)
template <class T> using V = vector<T>;
template <class A, class B> void chmax(A& l, const B& r){ if(l < r) l = r; }
template <class A, class B> void chmin(A& l, const B& r){ if(r < l) l = r; }


void testcase(){
  ll N; cin >> N;
  V<ll> X, Y;
  ll d = 0;
  REP(i,N*2){
    ll x ,y; cin >> x >> y;
    char c; cin >> c;
    if(c == 'x'){
      Y.push_back(y);
      d++;
    } else {
      X.push_back(x);
      d--;
    }
  }
  if(d > 0) swap(X, Y);
  sort(X.begin(), X.end());
  ll cnt = 0;
  while(X.size()){
    if(X.size() >= 2 && X[X.size() - 2] == X.back()){
      cnt++;
      X.pop_back();
    }
    X.pop_back();
  }
  if(cnt * 2 >= abs(d)) cout << "Yes\n"; else cout << "No\n";
}

int main(){
  cin.tie(0)->sync_with_stdio(0);
  ll T; cin >> T; REP(t,T)
  testcase();
  return 0;
}