#include <bits/stdc++.h>

using i64 = long long;

std::vector<std::pair<int, int>> edges;

void solve() {
    int k;
    std::cin >> k;

    std::string s;
    std::cin >> s;

    std::vector<int> score(10);
    for (int i = 0; i < k; i++) {
        auto [x, y] = edges[i];
        if (s[i] == '1') {
            score[x]++;
        } else {
            score[y]++;
        }
    }

    std::vector<std::pair<int, int>> e;
    for (int i = k; i < edges.size(); i++) {
        auto [x, y] = edges[i];
        if (x == 0) {
            score[0]++;
        } else {
            e.emplace_back(x, y);
        }
    }

    for (int s = 0; s < (1 << 10); s += 2) {
        if (__builtin_popcount(s) == 3) {
            int ok = 1;
            for (int i = 1; i < 10; i++) {
                if ((~s >> i & 1) && score[i] > score[0]) {
                    ok = 0;
                    break;
                }
            }
            if (!ok) {
                continue;
            }
            int match = 0;
            for (int t = 0; t < (1 << 10); t += 2) {
                int res = 0;
                for (int i = 1; i < 10; i++) {
                    if (t >> i & 1) {
                        if (s >> i & 1) {
                            res -= 100;
                        } else {
                            res -= score[0] - score[i];
                        }
                    }
                }
                for (auto [x, y] : e) {
                    res += (t >> x & 1) || (t >> y & 1);
                }
                match = std::min(match, res);
            }
            for (int i = 1; i < 10; i++) {
                if (s >> i & 1) {
                    match += 100;
                } else {
                    match += score[0] - score[i];
                }
            }
            if (match == e.size()) {
                std::cout << "YES\n";
                return;
            }
        }
    }

    std::cout << "NO\n";
}

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

    std::vector<int> p(10);
    std::iota(p.begin(), p.end(), 0);
    for (int t = 0; t < 9; t++) {
        for (int i = 0; i < 5; i++) {
            edges.emplace_back(p[i], p[9 - i]);
        }
        std::rotate(p.begin() + 1, p.end() - 1, p.end());
    }

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}