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

typedef pair<int,int> pii;
vector<pii>matches;
int n = 10;

bool winable(vector<int>wins, vector<int>rem, int k, int a, int b, int c){
    vector<bool>winer(n);
    winer[a] = winer[b] = winer[c] = true;
    for(int i=k; i<matches.size(); i++){
        auto [u,v] = matches[i];
        if(!winer[u] and !winer[v]) continue;
        if(u==0) continue;
        if(winer[u]){
            wins[u]++;
        }
        else if(winer[v]){
            wins[v]++;
        }
        rem[ u ]--;
        rem[ v ]--;
    }

    vector< vector<int> >g(n);
    for(int i=k; i<matches.size(); i++){
        auto [u,v] = matches[i];
        if(winer[u] or winer[v] or u==0) continue;

        g[u].push_back(v);
        g[v].push_back(u);
    }


    auto cmp = [&](int bam, int dan) {
        return wins[bam]+rem[bam] < wins[dan]+rem[dan];
    };


    vector<int>bakis;
    for(int i=1; i<n; i++) if(rem[i]){
        bakis.push_back(i);
//        cout<<i<<" -- "<<rem[i]<<" -- "<<g[i].size()<<endl;
//        assert(g[i].size() == rem[i]);
    }
    while(!bakis.empty()){
        sort(bakis.begin(), bakis.end(), cmp);
        int u = bakis[0];
        sort(g[u].begin(), g[u].end(), cmp);

        assert(g[u].size() == rem[u]);
        int v = g[u].back();
        wins[u]++;
        rem[u]--;
        rem[v]--;

//        cout<<u<<" beats "<<v<<endl;
        g[u].pop_back();
        g[v].erase( find(g[v].begin(), g[v].end(), u) );
        bakis.clear();
        for(int i=1; i<n; i++) if(rem[i]) bakis.push_back(i);
    }

    int bigar = 0;
    for(int i=1; i<n; i++) if(wins[i]>wins[0]) bigar++;
    if(bigar>=4) return false;
    return true;
}

/*
1
3
111
*/

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

//    for(auto [u,v] : matches){
//        cout<<u<<" - "<<v<<endl;
//    }
    vector<int>wins(10);
    vector<int>rem(10, 9);
    for(int i=0; i<k; i++){
        if(s[i]=='1'){
            wins[ matches[i].first ]++;
        }
        else{
            wins[ matches[i].second ]++;
        }
        rem[ matches[i].first ]--;
        rem[ matches[i].second ]--;
    }
    for(int i=k; i<matches.size(); i++){
        if(matches[i].first==0){
            wins[0]++;
            rem[ matches[i].first ]--;
            rem[ matches[i].second ]--;
        }
    }

    for(int a=1; a<n; a++) for(int b=a+1; b<n; b++) for(int c=b+1; c<n; c++){
//        cout<<a<<" - "<<b<<" - "<<c<<endl;
        if( winable(wins, rem, k, a,b,c) ){
            cout<<"YES\n";
            return;
        }
    }
    cout<<"NO\n";


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