#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());
        }
    }

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

    for (int x = 0; x < N; ++x) {
        for (int y = 0; y < N; ++y) {
            for (int z = 0; z < N; ++z) {
                
                auto q = p;
                std::vector<std::pair<int, int>> vec;

                for (int _ = k; _ < matches.size(); ++_) {
                    auto [a, b] = matches[_];
                    if (a == 0 || b == 0) {
                        q[0] += 1;
                    } else if (a != x && a != y && a != z && b != x && b != y && b != z) {
                        vec.emplace_back(a, b);
                    }
                }

                for (int _ = 0; _ < 500; ++_) {
                    std::shuffle(vec.begin(), vec.end(), rbg);
                    for (auto [a, b] : vec) {
                        if (B2(rbg)) {
                            std::swap(a, b);
                        }
                        if (q[a] < q[b]) {
                            q[a] += 1;
                        } else {
                            q[b] += 1;
                        }
                    }
                    if (std::none_of(q.begin(), q.end(), [&](int v) {
                        return v > q[0];
                    })) {
                        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;
}