#include <bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()

using pii = array<int, 2>;
using vi = vector<int>;

array<pii, 45> mt;

void solve() {
    int n;
    string s;
    cin >> n >> s;
    vi wold(10);
    for (int i = 0; i < n; ++i) {
        int b = s[i] - '0';
        ++wold[mt[i][b ^ 1]];
    }
    for (int i = n; i < 45; ++i) {
        auto [x, y] = mt[i];
        if (!x)++wold[x];
        if (!y)++wold[y];
    }
    vector<int> p(9);
    iota(p.begin(), p.end(), 0);
    do {
        auto w = wold;
        for (int i = n; i < 45; ++i) {
            auto [x, y] = mt[i];
            if (!x || !y)continue;
            if (p[x - 1] < p[y - 1]) {
                w[x]++;
                w[y]++;
            }
        }
        int val = w[0];
        sort(w.rbegin(), w.rend());
        if (val >= w[3]) {
            cout << "YES\n";
            return;
        }
    } while (next_permutation(p.begin(), p.end()));

    cout << "NO\n";
}

int main() {
    vi p(10);
    iota(all(p), 0);
    for (int i = 0; i < 9; ++i) {
        for (int j = 0; j < 5; ++j) {
            mt[i * 5 + j] = {p[j], p[9 - j]};
        }
        vi pn(p);
        pn[1] = p.back();
        for (int j = 2; j < 10; ++j) {
            pn[j] = p[j - 1];
        }
        p = pn;
    }
    // for (int i = 0; i < 45; ++i) {
    //     if (i % 5 == 0) {
    //         cout << endl;
    //     }
    //     cout << mt[i][0] + 1 << ' ' << mt[i][1] + 1 << endl;
    // }
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}