//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
class MaximumFlow
{
	private:
		struct edge
		{
			int u,v,capa;
		}E[10010];
		edge make_edge(int u,int v,int capa)
		{
			edge e;
			e.u=u;
			e.v=v;
			e.capa=capa;
			return e;
		}
		vector<int> G[1010];
		int p;
		bool inque[1010];
		int dep[1010];
		bool bfs(int s,int t)
		{
			for(int i=0;i<1010;i++)
				dep[i]=inf;
			memset(inque,0,sizeof(inque));
			dep[s]=0;
			inque[s]=1;
			queue<int> q;
			q.push(s);
			while(!q.empty())
			{
				int x=q.front();
				q.pop();
				inque[x]=0;
				for(int e:G[x])
				{
					int v=E[e].v;
					if(dep[v]>dep[x]+1&&E[e].capa)
					{
						dep[v]=dep[x]+1;
						if(!inque[v])
						{
							q.push(v);
							inque[v]=1;
						}
					}
				}
			}
			return (dep[t]!=inf);
		}
		int dfs(int u,int t,int aug)
		{
			int naug=0;
			if(u==t)
				return aug;
			for(int e:G[u])
			{
				int v=E[e].v;
				if(E[e].capa&&dep[v]==dep[u]+1)
				{
					if((naug=dfs(v,t,min(aug,E[e].capa))))
					{
						E[e].capa-=naug;
						E[e^1].capa+=naug;
						return naug;
					}
				}
			}
			return 0;
		}
	public:
		void clear()
		{
			p=0;
			for(int i=0;i<1010;i++)
				G[i].clear();
		}
		MaximumFlow()
		{
			clear();
		}
		void addEdge(int u,int v,int capa)
		{
			G[u].pb(p);
			E[p++]=make_edge(u,v,capa);
			G[v].pb(p);
			E[p++]=make_edge(v,u,0);
		}
		int dinic(int s,int t)
		{
			int flow;
			int maxflow=0;
			while(bfs(s,t))
				while((flow=dfs(s,t,inf)))
					maxflow+=flow;
			return maxflow;
		}
};
MaximumFlow mf;
vector<int> a,b;
int cnt[15];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	for(int i=11;i>=3;i--)
	{
		vector<int> tmp;
		tmp.pb(1);
		for(int j=i;j<=10;j++)
			tmp.pb(j);
		for(int j=2;j<i;j++)
			tmp.pb(j);
		for(int x=0;x<5;x++)
			a.pb(tmp[x]);
		for(int x=0;x<5;x++)
			b.pb(tmp[9-x]);
	}
	int t;
	cin>>t;
	while(t--)
	{
		mf.clear();
		int k;
		cin>>k;
		string s;
		cin>>s;
		memset(cnt,0,sizeof(cnt));
		for(int i=0;i<k;i++)
			if(s[i]=='1')
				cnt[a[i]]++;
			else
				cnt[b[i]]++;
		int tot=0;
		for(int i=k;i<45;i++)
			if(a[i]==1||b[i]==1)
				cnt[1]++;
			else
			{
				mf.addEdge(100,i,1);
				tot++;
				mf.addEdge(i,45+a[i],1);
				mf.addEdge(i,45+b[i],1);
			}
		bool flag=1;
		for(int i=1;i<=10;i++)
			if(cnt[i]>cnt[1])
				flag=0;
		for(int i=1;i<=10;i++)
			mf.addEdge(45+i,101,cnt[1]-cnt[i]);
		if(flag&&mf.dinic(100,101)==tot)
			cout<<"YES\n";
		else
			cout<<"NO\n";
	}
	return 0;
}