#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 w(10);
        for (int i = 0; i < n; ++i) {
            int b = s[i] - '0';
            ++w[mt[i][b ^ 1]];
        }
        for (int i = n; i < 45; ++i) {
            auto [x, y] = mt[i];
            if (x == 0) {
                ++w[x];
            }
        }

        for (int i = n; i < 45; ++i) {
            auto [x, y] = mt[i];
            if (x == 0) {
                continue;
            }
            if (w[x] > w[0]) {
                if (w[y] > w[0]) {
                    if (w[x] > w[y]) {
                        swap(x, y);
                    }
                    ++w[x];
                } else {
                    ++w[x];
                }
            } else {
                if (w[y] > w[0]) {
                    ++w[y];
                } else {
                    if (w[x] > w[y]) {
                        swap(x, y);
                    }
                    ++w[x];
                }
            }
        }

        vector<pii> srt;
        for (int i = 0; i < 9; ++i) {
            srt.push_back({w[i], i});
        }
        sort(all(srt));
        cout << (w[0] >= srt[6][0] ? "YES" : "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();
        }
    }