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

typedef pair<int,int> pii;
vector<pii>matches;


void testcase(int cs){
    int k;
    cin>>k;
    string s;
    cin>>s;


//    for(auto [u,v] : matches){
//        cout<<u<<" - "<<v<<endl;
//    }
    int n = 10;
    vector<int>wins(10);
    for(int i=0; i<k; i++){
        if(s[i]=='1') wins[ matches[i].first ]++;
    }
    vector<pii>shob(n-1);
    for(int i=k; i<matches.size(); i++){
        if(matches[i].first==0) wins[0]++;
    }
    for(int i=1; i<n; i++) shob.emplace_back(wins[i], i);
    sort(shob.rbegin(), shob.rend());
    vector<bool>winer(n);
    winer[shob[0].second]=true;
    winer[shob[1].second]=true;
    winer[shob[2].second]=true;

    for(int i=k; i<matches.size(); i++){
        if(matches[i].first!=0){
            auto [u,v] = matches[i];
            if(winer[u]) wins[u]++;
            else if(winer[v]) wins[v]++;
            else{
                if(wins[u]<wins[v]) swap(u,v);
                wins[v]++;
            }
        }
    }
    int bigar = 0;
    for(int i=1; i<n; i++) if(wins[i]>wins[0]) bigar++;
    if(bigar>=4) cout<<"NO\n";
    else cout<<"YES\n";
}

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

    vector<int>teams;
    for(int i=1; i<=10; i++) teams.push_back(i-1);
    for(int i=1; i<=9; i++){
        for(int j=0, k=teams.size()-1; j<k; j++, k--){
            matches.emplace_back(teams[j], teams[k]);
        }
        deque<int>tmp;
        for(int j=1; j<teams.size(); j++) tmp.push_back(teams[j]);
        int x = tmp.back();
        tmp.pop_back();
        tmp.push_front(x);
        for(int j=1, i=0; j<teams.size(); j++, i++) teams[j] = tmp[i];
    }


    int T = 1;
    cin >> T;
    for(int cs = 1; cs <= T; ++cs){
        testcase(cs);
    }
}