#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template <typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

vector<pair<int, int>> matches;

void init() {
	vector<int> rank(10);
	for (int i = 0; i < 10; i++) {
		rank[i] = i;
	}
	sort(rank.begin(), rank.end());
	for (int i = 0; i < 9; i++) {
		matches.emplace_back(rank[0], rank[9]);
		matches.emplace_back(rank[1], rank[8]);
		matches.emplace_back(rank[2], rank[7]);
		matches.emplace_back(rank[3], rank[6]);
		matches.emplace_back(rank[4], rank[5]);

		rotate(rank.begin()+1, rank.end()-1, rank.end());
	}
}

struct Dinic {
	struct Edge {
		int to, rev;
		ll c, oc;
		ll flow() { return max(oc - c, 0LL); } // if you need flows
	};
	vi lvl, ptr, q;
	vector<vector<Edge>> adj;
	Dinic(int n) : lvl(n), ptr(n), q(n), adj(n) {}
	void addEdge(int a, int b, ll c, int rcap = 0) {
		adj[a].push_back({b, sz(adj[b]), c, c});
		adj[b].push_back({a, sz(adj[a]) - 1, rcap, rcap});
	}
	ll dfs(int v, int t, ll f) {
		if (v == t || !f) return f;
		for (int& i = ptr[v]; i < sz(adj[v]); i++) {
			Edge& e = adj[v][i];
			if (lvl[e.to] == lvl[v] + 1)
				if (ll p = dfs(e.to, t, min(f, e.c))) {
					e.c -= p, adj[e.to][e.rev].c += p;
					return p;
				}
		}
		return 0;
	}
	ll calc(int s, int t) {
		ll flow = 0; q[0] = s;
		rep(L,0,31) do { // 'int L=30' maybe faster for random data
			lvl = ptr = vi(sz(q));
			int qi = 0, qe = lvl[s] = 1;
			while (qi < qe && !lvl[t]) {
				int v = q[qi++];
				for (Edge e : adj[v])
					if (!lvl[e.to] && e.c >> (30 - L))
						q[qe++] = e.to, lvl[e.to] = lvl[v] + 1;
			}
			while (ll p = dfs(s, t, LLONG_MAX)) flow += p;
		} while (lvl[t]);
		return flow;
	}
	bool leftOfMinCut(int a) { return lvl[a] != 0; }
};

void solve() {
	int k; cin >> k;
	string s; cin >> s;

	for (int msk = 0; msk < (1 << 9); msk++) {
		if (__builtin_popcount(msk) != 3) continue;

		Dinic dn(45+10+2);
		int src = 0, sink = 45+10+1;
		vector<int> prescore(10);

		int flneed = 0;
		for (int i = 0; i < 45; i++) {
			auto [x, y] = matches[i];
			dn.addEdge(0, i+1, 1);
			if (i < k) {
				if (s[i] == '1') prescore[x]++;
				else prescore[y]++;
			} else {
				if (x == 0 || y == 0) {
					prescore[0]++;	
				} else {
					flneed++;
					dn.addEdge(i+1, 46+x, 1);
					dn.addEdge(i+1, 46+y, 1);
				}
			}
		}

		// team to sink
		bool ok = 1;
		for (int i = 1; i < 10; i++) {
			if (msk & (1 << (i-1))) {
				// allowed to beat prescore[0]
				dn.addEdge(46+i, sink, 1000);
			} else {
				// not allowed to beat prescore
				if (prescore[i] > prescore[0]) {
					ok = 0; break;
				}
				dn.addEdge(46+i, sink, prescore[0] - prescore[i]);
			}
		}
		if (!ok) continue;

		// can all matches be conducted?
		if (dn.calc(src, sink) == flneed) {
			cout << "YES\n";
			return;
		}
	}
	cout << "NO\n";
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);
	init();
	
	int t; cin >> t;
	while (t--) {
		solve();
	}
	
	return 0;
}