#include <bits/stdc++.h>

std::mt19937 rbg(std::chrono::steady_clock::now().time_since_epoch().count());
auto B2 = std::bernoulli_distribution{0.5};
constexpr int N = 10;

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

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

    std::vector<std::pair<int, int>> matches;
    {
        std::vector<int> a(N);
        std::iota(a.begin(), a.end(), 0);

        auto roll = [](auto begin, auto end) {
            auto x = *(end - 1);
            for (auto it = end - 1; it != begin; --it) {
                *it = *(it - 1);
            }
            *begin = x;
        };
        for (int i = 1; i <= 9; ++i) {
            for (int j = 0; j < 5; ++j) {
                matches.emplace_back(a[j], a[N - 1 - j]);
            }
            roll(a.begin() + 1, a.end());
        }
    }

    if (k <= 15) {
        std::cout << "YES\n";
        return;
    }

    std::vector<int> p(N);
    for (int i = 0; i < k; ++i) {
        if (s[i] == '1') {
            p[matches[i].first] += 1;
        } else {
            p[matches[i].second] += 1;
        }
    }

    std::vector<std::pair<int, int>> a;
    for (int i = k; i < matches.size(); ++i) {
        auto [x, y] = matches[i];
        if (x == 0 || y == 0) {
            p[0] += 1;
        } else {
            a.emplace_back(x, y);
        }
    }
    
    int tot = a.size();
    for (int S = 0; S < (1 << tot); ++S) {
        auto q = p;
        for (int i = 0; i < tot; ++i) {
            if (S & (1 << i)) {
                q[matches[i].first] += 1;
            } else {
                q[matches[i].second] += 1;
            }
        }
        int cnt{};
        for (int i = 0; i < N; ++i) {
            if (q[i] > p[0]) {
                ++cnt;
            }
        }
        if (cnt <= 3) {
            std::cout << "YES\n";
            return;
        }
    }

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

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

    int t;
    std::cin >> t;

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

    return 0;
}