#include <bits/stdc++.h>

#define rep(i,s,n) for(int i = int(s); i < int(n); i++)
#define rrep(i,s,n) for(int i = int(n) - 1; i >= int(s); i--)
#define all(v) (v).begin(), (v).end();

using ll = long long;
using ld = long double;
using ull = unsigned long long;

bool chmin(auto &a, auto b) {
    if(a <= b) return false;
    a = b;
    return true;
}

bool chmax(auto &a, auto b) {
    if(a >= b) return false;
    a = b;
    return true;
}

using namespace std;

void solve(){
    deque<int> waitinglist = {1, 2, 3, 4, 5, 6, 7, 8, 9};

    vector<int> x, y;
    rep(i,0,9){
        waitinglist.push_front(waitinglist.back());
        waitinglist.pop_back();
        waitinglist.push_front(0);
        rep(j,0,5){
            x.push_back(waitinglist[j]);
            y.push_back(waitinglist[9-j]);
        }
        waitinglist.pop_front();
    }

    int n = 45;
    int m; cin >> m;
    string s; cin >> s;
    if (m <= 25){
        cout << "YES\n";
        return;
    }

    vector<int> wins(10);
    rep(j,0,m){
        if (s[j]=='1'){
            wins[x[j]]++;
        }else{
            wins[y[j]]++;
        }
    }

    rep(i,0,1<<(n-m)){
        vector<int> tmp = wins;
        rep(j,0,n-m){
            if (i>>j&1){
                tmp[x[j+m]]++;
            }else{
                tmp[y[j+m]]++;
            }
        }
        int cnt = 0;
        rep(j,1,10){
            if (tmp[j] > tmp[0]) cnt++;
        }
        if (cnt <= 3){
            cout << "YES\n";
            return;
        }
    }
    cout << "NO\n";



}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int t; cin >> t;
    while(t--) solve();
}