#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<int>F(const vector<int>&A,const vector<int>&B)
{
	vector<int>ret;
	int bi=0;
	for(int a:A)
	{
		while(bi<B.size()&&B[bi]<a)bi++;
		if(bi<B.size()&&B[bi]==a)bi++,ret.push_back(a);
	}
	return ret;
}
int main()
{
	int T;cin>>T;
	for(;T--;)
	{
		int N;cin>>N;
		vector<vector<int> >D(3);
		for(int i=0;i<N;i++)
		{
			char c;int d;cin>>c>>d;
			D[c=='R'?0:c=='G'?1:2].push_back(d);
		}
		for(int i=0;i<D.size();)
		{
			if(D[i].empty())D.erase(D.begin()+i);
			else sort(D[i].begin(),D[i].end()),i++;
		}
		if(D.size()==1)cout<<"YES\n";
		else if(D.size()==2)
		{
			if(F(D[0],D[1]).empty())cout<<"NO\n";
			else cout<<"YES\n";
		}
		else
		{
			vector<int>A=F(D[0],D[1]),B=F(D[0],D[2]),C=F(D[1],D[2]);
			bool fn=false;
			if(!A.empty()&&!B.empty())
			{
				if(D[0].size()==1)fn=true;
				else if(A.size()>=2||B.size()>=2)fn=true;
				else if(A[0]!=B[0])fn=true;
			}
			if(!A.empty()&&!C.empty())
			{
				if(D[1].size()==1)fn=true;
				else if(A.size()>=2||C.size()>=2)fn=true;
				else if(A[0]!=C[0])fn=true;
			}
			if(!B.empty()&&!C.empty())
			{
				if(D[2].size()==1)fn=true;
				else if(B.size()>=2||C.size()>=2)fn=true;
				else if(B[0]!=C[0])fn=true;
			}
			cout<<(fn?"YES\n":"NO\n");
		}
	}
}