// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 500005
#define inf 0x3f3f3f3f

int n,p[maxn];
int e[15][15],f[15][15];
pii t[maxn];
int m;

int d[15];

bool solve(int s){
	For(i,1,n) For(j,1,n) e[i][j]=f[i][j];
	For(i,1,n)d[i]=0;
	For(i,1,n) For(j,1,n) if(e[i][j]==1) ++d[i];
//	For(i,1,n)cout<<d[i]<<" "; cout<<" d\n";
	vi o;
	For(i,2,n){
		if(s>>(i-1)&1){
			
		}else{
			o.pb(i);
		}
	}
	
	while(o.size()){
		sort(o.begin(),o.end(),[&](int u,int v){
			return d[u]<d[v];
		});
		int u=o.back();o.pop_back();
		if(d[u]>d[1]) return 0;
		int tmp=d[1]-d[u];
		Rep(i,(int)o.size()-1,0){
			int x=o[i];
			if(e[x][u]==-1){
				if(tmp) --tmp;
				else ++d[x];
			}
		}
	}
//	cout<<"ok "<<s<<"\n";
	return 1;
}

void work()
{
	n=10;
	For(i,1,n)For(j,1,n)e[i][j]=-1;
	int k=read(); string s;cin>>s;
	if(k<=20){
		puts("YES");
		return;
	}
	For(i,0,k-1){
		int u=t[i].fi,v=t[i].se;
	//	cout<<"u,v "<<u<<" "<<v<<" "<<(s[i]&1)<<"\n";
		e[u][v]=(s[i]&1);
		e[v][u]=(!e[u][v]);
	}
	For(i,1,1)For(j,2,n) if(e[i][j]==-1) e[i][j]=1,e[j][i]=0;
	For(i,1,n)For(j,1,n) f[i][j]=e[i][j];
	
	vector<pii>o;
	For(i,1,n)For(j,i+1,n)if(f[i][j]==-1)o.pb(mkp(i,j));
	For(s,0,(1<<(o.size()))-1){
		For(i,1,n) d[i]=0; 
		For(i,1,n) For(j,1,n) if(f[i][j]==1) d[i]++;
		For(i,0,(int)o.size()-1){
			int u=o[i].fi,v=o[i].se;
			if(s>>i&1) ++d[v];
			else ++d[u];
		}
		int cnt=0;
		For(i,2,n) cnt+=(d[i]>d[1]);
		if(cnt<4) {
			puts("YES");
			return;
		}
	}
	
	puts("NO");
}

signed main()
{
	n=10;
	For(i,1,10)p[i]=i;
	For(i,1,9){
		For(j,1,5) t[m++]=mkp(p[j],p[n+1-j]);
		rotate(p+2,p+n,p+n+1);
	}
	int T=read();
	while(T--)work();
	return 0;
}
/*

*/