#include <bits/stdc++.h>

using namespace std;

string s;
int base[15];
int cnt[15];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T;
    cin >> T;
    vector<pair<int, int>> vec;
    vector<pair<int, int>> without0;
    vector<int> teams = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
    for (int i = 0; i < 9; i++) {
        for (int j = 0; j < 5; j++) {
            vec.emplace_back(teams[j], teams[9 - j]);
            if (j) {
                without0.emplace_back(teams[j], teams[9 - j]);
            }
        }
        rotate(teams.begin() + 1, teams.end() - 1, teams.end());
    }
    reverse(without0.begin(), without0.end());
    // for (int i = 0; i < vec.size(); i++) {
    //     cout << vec[i].first << " " << vec[i].second << endl;
    // }
    while(T--) {
        int K;
        cin >> K;
        cin >> s;
        fill(base, base + 10, 0);
        if (K <= 20) {
            cout << "YES\n";
            continue;
        }
        for (int k = 0; k < K; k++) {
            if (s[k] == '1') {
                base[vec[k].first]++;
            }
            else {
                base[vec[k].second]++;
            }
        }
        int left = 45 - K;
        base[0] += left / 5;
        left -= left / 5;
        bool good = 0;
        for (int msk = 0; msk < (1 << left); msk++) {
            for (int t = 0; t < 10; t++) {
                cnt[t] = base[t];
            }
            for (int t = 0; t < left; t++) {
                if (msk>>t&1) {
                    cnt[without0[t].first]++;
                }
                else {
                    cnt[without0[t].second]++;
                }
            }
            int c = 0;
            for (int v = 1; v < 10; v++) {
                c += (cnt[0] < cnt[v]);
            }
            if (c <= 3) {
                good = 1;
                break;
            }
        }
        if (good) {
            cout << "YES\n";
        }
        else {
            cout << "NO\n";
        }
    }

}