#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<vector<int>> ranks;
vector<pair<int, int>> matches;

void init() {
	// ok rankings
	vector<int> rank(10);
	for (int i = 0; i < 10; i++) {
		rank[i] = i;
	}
	do {
		if (rank[0] < 4) ranks.push_back(rank);
	} while (next_permutation(rank.begin(), rank.end()));

	// matches order
	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());
	}
}

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

	for (auto rank: ranks) {
		vector<int> score(10);
		for (int i = 0; i < 45; i++) {
			auto [x, y] = matches[i];
			if (i < k) {
				if (s[i] == '1') score[x]++;
				else score[y]++;
			} else {
				if (x == 0 || y == 0) {
					score[0]++;
				} else {
					if (rank[x] < rank[y]) x++;
					else y++;
				}
			}
		}

		// is top 4?
		int top = 0;
		for (int i = 1; i < 10; i++) {
			if (score[i] > score[0]) top++;
		}
		if (top > 3) continue;
		else {
			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;
}