#include <bits/stdc++.h>
#define pb push_back
#define int int64_t
#define pii pair<int, int>
#define X first
#define Y second
#define all(x) (x).begin(),(x).end()
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)(x).size()
#define rep(i, a, b) for(int i = a; i < (b); ++i)
	
using namespace std;

const int inf = 1e18;

void p(auto A){
	for(auto e : A)cout << e << ' ';
	cout << '\n';
}


typedef int64_t ll;
typedef vector<int> vi;

struct PushRelabel {
	struct Edge {
		int dest, back;
		ll f, c;
	};
	vector<vector<Edge>> g;
	vector<ll> ec;
	vector<Edge*> cur;
	vector<vi> hs; vi H;
	PushRelabel(int n) : g(n), ec(n), cur(n), hs(2*n), H(n) {}

	void addEdge(int s, int t, ll cap, ll rcap=0) {
		if (s == t) return;
		g[s].push_back({t, sz(g[t]), 0, cap});
		g[t].push_back({s, sz(g[s])-1, 0, rcap});
	}

	void addFlow(Edge& e, ll f) {
		Edge &back = g[e.dest][e.back];
		if (!ec[e.dest] && f) hs[H[e.dest]].push_back(e.dest);
		e.f += f; e.c -= f; ec[e.dest] += f;
		back.f -= f; back.c += f; ec[back.dest] -= f;
	}
	ll calc(int s, int t) {
		int v = sz(g); H[s] = v; ec[t] = 1;
		vi co(2*v); co[0] = v-1;
		rep(i,0,v) cur[i] = g[i].data();
		for (Edge& e : g[s]) addFlow(e, e.c);

		for (int hi = 0;;) {
			while (hs[hi].empty()) if (!hi--) return -ec[s];
			int u = hs[hi].back(); hs[hi].pop_back();
			while (ec[u] > 0)  // discharge u
				if (cur[u] == g[u].data() + sz(g[u])) {
					H[u] = 1e9;
					for (Edge& e : g[u]) if (e.c && H[u] > H[e.dest]+1)
						H[u] = H[e.dest]+1, cur[u] = &e;
					if (++co[H[u]], !--co[hi] && hi < v)
						rep(i,0,v) if (hi < H[i] && H[i] < v)
							--co[H[i]], H[i] = v + 1;
					hi = H[u];
				} else if (cur[u]->c && H[u] == H[cur[u]->dest]+1)
					addFlow(*cur[u], min(ec[u], cur[u]->c));
				else ++cur[u];
		}
	}
	bool leftOfMinCut(int a) { return H[a] >= sz(g); }
};


void solve(){
	vector<pii> games;
	vector<int> teams;
	for(int i = 2; i<= 10; i++)teams.pb(i);
	for(int i = 0; i< 9; i++){
		games.pb({1, teams.back()});
		for(int j = 0; j< 4; j++)games.pb({teams[j], teams[teams.size()-j-2]});
		rotate(teams.rbegin(), teams.rbegin()+1, teams.rend());
	}
	//for(auto&[x, y] : games)if(x > y)swap(x, y);
	//for(auto[x, y]:games)cout << x << ' ' << y << endl;
	
	int k; cin >> k;
	string A; cin >> A;
	vector<int>points(11);
	for(int i = 0; i< k; i++){
		if(A[i]=='1')points[games[i].X]++;
		else points[games[i].Y]++;
	}
	for(int i = k; i< 45; i++){
		if(games[i].X==1||games[i].Y==1)points[1]++;
	}
	int mx = points[1];
	
	for(int i = 2; i<= 10; i++){
		for(int j = i+1; j<= 10; j++){
			for(int l = j+1; l<= 10; l++){
				PushRelabel F(60);
				for(int g = 1; g<= 45; g++)F.addEdge(0, g, 1);
				
				for(int id = 1; id <= k; id++){
					if(A[id-1]=='1')F.addEdge(id, 45+games[id-1].X, 1);
					else F.addEdge(id, 45+games[id-1].Y, 1);
				}
				for(int id = k+1; id <= 45; id++){
					F.addEdge(id, 45+games[id-1].X, 1);
					F.addEdge(id, 45+games[id-1].Y, 1);
				}
				for(int id = 1; id<= 10; id++){
					if(id==1||id==i||id==j||id==l)F.addEdge(45+id, 56, 100);
					else F.addEdge(45+id, 56, mx);
				}
				if(F.calc(0, 56) == 45){
					cout << "YES\n";
					return;
				}
			}
		}
	}
	cout << "NO\n";
}

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int t = 1;
	cin >> t;
	while(t--)solve();
}


//freopen(".in", "r", stdin);
//freopen(".out", "w", stdout);