#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using P=pair<ll,ll>;
typedef atcoder::modint mint;
ll inf=9e18;
template<class... T>
constexpr auto max(T... a){return max(initializer_list<common_type_t<T...>>{a...});}
template<class... T>
constexpr auto min(T... a){return min(initializer_list<common_type_t<T...>>{a...});}
template<typename T, int s, int i = 0>
auto vec(const ll (&sizes)[s], const T& init = T()){
  if constexpr(i < s) return vector(sizes[i], vec<T, s, i+1>(sizes, init));
  else return init;
}


void solve(){
  ll n,count=0,x,y;
  char c;
  cin>>n;
  auto v=vec<ll>({2,0},0);
  for(ll i=0;i<n*2;i++){
    cin>>x>>y>>c;
    if(c=='x') {v[0].push_back(y);count++;}
    else {v[1].push_back(x);}
  }
  ll u=abs(count-n);
  // cout<<u<<"\n";
  unordered_set<ll> r;
  if(count>n){
    for(ll i=0;i<v[0].size();i++){
      if(r.contains(v[0][i])){u--;r.erase(v[0][i]);}
      else r.insert(v[0][i]);
    }
  }
  else{
    for(ll i=0;i<v[1].size();i++){
      if(r.contains(v[1][i])){u--;r.erase(v[1][i]);}
      else r.insert(v[1][i]);
    }
  }
  if(u<=0) cout<<"Yes\n";
  else cout<<"No\n";
}

int main(){
  ll t;
  cin>>t;
  for(ll T=0;T<t;T++){
    solve();
  }
}