#include<bits/stdc++.h> using namespace std; using lint=long long; #define rep(i,n) for(int i=0;i<int(n);++i) #define all(n) (n).begin(),(n).end() void solve(){ lint n; cin>>n; vector<string>s(n); vector<lint>cnt(3); set<pair<lint,char>>ss; rep(i,n){ string tmp; char c; lint j; cin>>tmp>>j; c=tmp[0]; j--; if(ss.count(make_pair(j,c))){ assert(0); } ss.emplace(j,c); assert(0<=j&j<n); s[j]+=c; string t="BGR"; rep(k,3){ if(t[k]==c){ cnt[k]++; } } } assert(cnt[0]+cnt[1]+cnt[2]==n); rep(i,n)sort(all(s[i])); sort(all(s)); //rep(i,n)cerr<<s[i]<<endl; //cerr<<"end"<<endl; lint p=count(all(s),"GR"); lint q=count(all(s),"BR"); lint r=count(all(s),"BG"); if((p&&q)||(q&&r)||(r&&p)){ cout<<"YES"<<endl; }else if((p||q||r)&&count(all(s),"BGR")){ cout<<"YES"<<endl; }else if(count(all(s),"BGR")&&*min_element(all(cnt))==1){ cout<<"YES"<<endl; }else if(count(all(s),"BGR")>=2){ cout<<"YES"<<endl; }else if((p&&cnt[0]==0)||(q&&cnt[1]==0)||(r&&cnt[2]==0)){ cout<<"YES"<<endl; }else if((cnt[0]==n)||(cnt[1]==n)||(cnt[2]==n)){ cout<<"YES"<<endl; }else{ cout<<"NO"<<endl; } } int main(){ int t; cin>>t; while(t--)solve(); }