#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define all(a) (a).begin(),(a).end()
#ifdef DEBUG
template<class T>
ostream& operator << (ostream &out,vector<T> a){
	out<<'[';
	for(T x:a)out<<x<<',';
	return out<<']';
}
template<class T>
vector<T> ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<class T>
void debug(T x){
	cerr<<x<<endl;
}
template<class T,class...S>
void debug(T x,S...y){
	cerr<<x<<' ',debug(y...);
}
#else
#define debug(...) void()
#endif
const int N=50,INF=1e9;
namespace Flow{
	const int V=1e5,E=1e5;
	int s,t,kk,head[V],d[V],cur[V];
	struct edges{
		int to,c,nex;
	}edge[E];
	void init(int x,int y){
		s=x,t=y,kk=1;
		fill(head+s,head+1+t,0);
	}
	bool chk(int i){
		return !edge[i].c;
	}
	int add(int u,int v,int c){
		// debug(u,v,c);
		edge[++kk]={v,c,head[u]},head[u]=kk;
		edge[++kk]={u,0,head[v]},head[v]=kk;
		return kk-1;
	}
	bool bfs(){
		queue<int>q;
		q.push(s);
		copy(head+s,head+1+t,cur+s);
		fill(d+s,d+1+t,-1),d[s]=0;
		for(int u;!q.empty();){
			u=q.front(),q.pop();
			for(int i=head[u];i;i=edge[i].nex){
				int v=edge[i].to;
				if(edge[i].c&&!~d[v])d[v]=d[u]+1,q.push(v);
			}
		}
		return ~d[t];
	}
	int dfs(int u,int lim=INF){
		if(u==t)return lim;
		int flow=0;
		for(int i=cur[u];i&&flow<lim;i=edge[i].nex){
			cur[u]=i;
			int v=edge[i].to,c=edge[i].c;
			if(!c||d[v]!=d[u]+1)continue;
			int f=dfs(v,min(lim-flow,c));
			if(!f)d[v]=-1;
			edge[i].c-=f,edge[i^1].c+=f,flow+=f;
		}
		return flow;
	}
	int dinic(){
		int flow=0;
		for(;bfs();)flow+=dfs(s);
		return flow;
	}
}
int T,n=10,m,k,t[N];
pair<int,int>a[N];
char str[N];
void get(){
	scanf("%d%s",&k,str+1);
	// for(int i=1;i<=m;i++)debug(a[i].first,a[i].second);
	for(int S=0;S<(1<<n);S++){
		if(S&1)continue;
		if(__builtin_popcount(S)>3)continue;
		memset(t,0,sizeof t);
		for(int i=1;i<=k;i++){
			t[str[i]&1?a[i].first:a[i].second]++;
		}
		// debug(ary(t,1,n));
		int s=0,p=n+m+1,cnt=0;
		Flow::init(s,p);
		for(int i=k+1;i<=m;i++){
			if(a[i].first==1)t[1]++;
			else if(S>>a[i].first-1&1)t[a[i].first]++;
			else if(S>>a[i].second-1&1)t[a[i].second]++;
			else{
				cnt++;
				Flow::add(s,i+n,1);
				Flow::add(i+n,a[i].first,1);
				Flow::add(i+n,a[i].second,1);
			}
		}
		auto chk=[&](){
			for(int i=2;i<=n;i++){
				if(S>>i-1&1)continue;
				if(t[i]>t[1])return 0;
				Flow::add(i,p,t[1]-t[i]);
			}
			if(Flow::dinic()==cnt)return 1;
			else return 0;
		};
		if(chk()){
			puts("YES");
			return;
		}
	}
	puts("NO");
}
int main(){
	n=10;
	static int p[N];
	iota(p,p+1+n,0);
	for(int i=1;i<n;i++){
		for(int l=1,r=n;l<r;l++,r--)a[++m]={p[l],p[r]};
		rotate(p+2,p+n,p+1+n);
	}
	for(scanf("%d",&T);T--;)get();
	return 0;
}