#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

const int MAXN = 100;

vector<int> G[MAXN];
int couple[MAXN];
int used[MAXN];

bool khun(int v, int c) {
    if (used[v] == c)
        return false;
    used[v] = c;
    for (int u : G[v]) {
        if (couple[u] == -1) {
            couple[u] = v;
            return true;
        }
    }
    for (int u : G[v]) {
        if (khun(couple[u], c)) {
            couple[u] = v;
            return true;
        }
    }
    return false;
}

void solve() {
    int k;
    cin >> k;
    string s;
    cin >> s;
    vector<pair<int, int>> games;
    vector<int> cur(10);
    iota(cur.begin(), cur.end(), 0);
    for (int i = 0; i < 9; ++i) {
        for (int j = 0; j < 5; ++j)
            games.emplace_back(cur[j], cur[9 - j]);
        rotate(cur.begin() + 1, cur.begin() + 9, cur.end());
    }
    vector<int> cur_cnt(10);
    for (int i = 0; i < k; ++i) {
        if (s[i] == '1')
            ++cur_cnt[games[i].first];
        else
            ++cur_cnt[games[i].second];
    }
    vector<int> mx_cnt(10);
    for (int i = k; i < 45; ++i) {
        if (games[i].first == 0 || games[i].second == 0) {
            ++cur_cnt[0];
        } else {
            ++mx_cnt[games[i].first];
            ++mx_cnt[games[i].second];
        }
    }
    vector<int> cur_mx_cnt(10);
    for (int a = 1; a < 10; ++a) {
        for (int b = a + 1; b < 10; ++b) {
            for (int c = b + 1; c < 10; ++c) {
                bool ok = true;
                for (int i = 0; i < 10; ++i)
                    cur_mx_cnt[i] = mx_cnt[i];
                for (int i = 0; i < 10; ++i) {
                    if (i != a && i != b && i != c) {
                        cur_mx_cnt[i] = min(cur_mx_cnt[i], cur_cnt[0] - cur_cnt[i]);
                        if (cur_mx_cnt[i] < 0)
                            ok = false;
                    }
                }
                if (!ok)
                    continue;
                for (int i = 1; i < 10; ++i)
                    cur_mx_cnt[i] += cur_mx_cnt[i - 1];
                int left_side = 0;
                int right_side = cur_mx_cnt.back();
                for (int i = k; i < 45; ++i) {
                    auto [x, y] = games[i];
                    if (x == 0 || y == 0) {
                        ;
                    } else {
                        for (int j = cur_mx_cnt[x - 1]; j < cur_mx_cnt[x]; ++j)
                            G[left_side].emplace_back(j);
                        for (int j = cur_mx_cnt[y - 1]; j < cur_mx_cnt[y]; ++j)
                            G[left_side].emplace_back(j);
                        ++left_side;
                    }
                }
                fill(used, used + left_side, -1);
                fill(couple, couple + right_side, -1);
                for (int i = 0; i < left_side; ++i) {
                    if (!khun(i, i)) {
                        ok = false;
                        break;
                    }
                }
                for (int i = 0; i < left_side; ++i) {
                    G[i].clear();
                }
                if (ok) {
                    cout << "YES\n";
                    return;
                }
            }
        }
    }
    cout << "NO\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}