#include<bits/stdc++.h>
using namespace std;
namespace dinic
{
	const int MAXN=111,MAXM=2333;
	struct edge
	{
		int v,f;
		edge *next,*rev;
	}*h[MAXN],pool[MAXM*2];
	int top;
	void addedge(int u,int v,int c)
	{
		edge *tmp=&pool[++top];tmp->v=v;tmp->next=h[u];h[u]=tmp;tmp->f=c;
		edge *pmt=&pool[++top];pmt->v=u;pmt->next=h[v];h[v]=pmt;pmt->f=0;
		tmp->rev=pmt;pmt->rev=tmp;
	}
	int level[MAXN],S=100,T=101;
	bool mklevel()
	{
		queue<int> q;
		memset(level,-1,sizeof(level));
		q.push(S);
		level[S]=0;
		while(not q.empty())
		{
			int u=q.front();q.pop();
			for(edge *tmp=h[u];tmp;tmp=tmp->next)
			{
				if(level[tmp->v]==-1 and tmp->f)
				{
					level[tmp->v]=level[u]+1;
					q.push(tmp->v);
				}
			}
			if(level[T]!=-1)return true;
		}
		return false;
	}
	int dinic(int u,int minf)
	{
		if(u==T)return minf;
		int totf=0;
		for(edge *tmp=h[u];tmp;tmp=tmp->next)
		{
			if(tmp->f and level[tmp->v]==level[u]+1)
			{
				int f=dinic(tmp->v,min(tmp->f,minf-totf));
				tmp->f-=f;tmp->rev->f+=f;totf+=f;
				if(totf==minf)return totf;
			}
		}
		if(totf==0)level[u]=-1;
		return totf;
	}
	void init()
	{
		memset(h,0,sizeof(h));
		top=0;
	}
	int gao()
	{
		int totf=0;
		while(mklevel())totf+=dinic(S,0x7fffffff);
		return totf;
	}
}
int main()
{
	ios_base::sync_with_stdio(false);
	int T;
	cin>>T;
	while(T--)
	{
		const int n=10,m=45;
		deque<int> a={2,3,4,5,6,7,8,9,10};
		vector<pair<int,int>> edges;
		for(int i=1;i<n;i++)
		{
			edges.emplace_back(1,a[8]);
			edges.emplace_back(a[0],a[7]);
			edges.emplace_back(a[1],a[6]);
			edges.emplace_back(a[2],a[5]);
			edges.emplace_back(a[3],a[4]);
			a.push_front(a.back());a.pop_back();
		}
		int k;
		cin>>k;
		string s;
		cin>>s;
		vector<int> score(n+5);
		for(int i=0;i<k;i++)
		{
			if(s[i]=='1')score[edges[i].first]++;
			else score[edges[i].second]++;
		}
		vector<pair<int,int>> prs;
		for(int i=k;i<m;i++)
		{
			if(edges[i].first==1)score[1]++;
			else if(edges[i].second==1)score[1]++;
			else
			{
				prs.emplace_back(i+1,m+edges[i].first);
				prs.emplace_back(i+1,m+edges[i].second);
			}
		}
		auto sol=[&](int x,int y,int z)
		{
			dinic::init();
			for(int i=k;i<m;i++)
			{
				dinic::addedge(dinic::S,i+1,1);
			}
			for(auto [u,v]:prs)
			{
				dinic::addedge(u,v,1);
			}
			for(int i=1;i<=n;i++)
			{
				if(i!=x and i!=y and i!=z)
				{
					if(score[i]>score[1])return false;
					dinic::addedge(m+i,dinic::T,score[1]-score[i]);
				}
				else
				{
					dinic::addedge(m+i,dinic::T,111);
				}
			}
			int res=dinic::gao();
//			cerr<<"solve "<<x<<' '<<y<<' '<<z<<' '<<res<<endl;
			if(res==(int)prs.size()/2)return true;
			return false;
		};
		int ok=0;
		for(int i=2;i<=n and not ok;i++)
		{
			for(int j=2;j<i and not ok;j++)
			{
				for(int k=2;k<j;k++)
				{
					if(sol(i,j,k))
					{
						ok=1;
						break;
					}
				}
			}
		}
		if(ok)cout<<"YES\n";
		else cout<<"NO\n";
		
	}
	
	return 0;
}