#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


template <class Flow> struct MaxFlow {
  // Watch out when using types other than int and long long.
  static constexpr Flow FLOW_EPS = 1e-10L;
  static constexpr Flow FLOW_INF = std::numeric_limits<Flow>::max();
  
  int n, m;
  vector<int> ptr, nxt, zu;
  vector<Flow> capa;

  explicit MaxFlow(int n_) : n(n_), m(0), ptr(n_, -1) {}
  void ae(int u, int v, Flow w0, Flow w1 = 0) {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    assert(0 <= w0);
    assert(0 <= w1);
    nxt.push_back(ptr[u]); zu.push_back(v); capa.push_back(w0); ptr[u] = m++;
    nxt.push_back(ptr[v]); zu.push_back(u); capa.push_back(w1); ptr[v] = m++;
  }

  vector<int> see, lev, que;

  Flow augment(int u, int t, Flow limFlow) {
    if (u == t) return limFlow;
    for (int &i = see[u]; ~i; i = nxt[i]) if (capa[i] > FLOW_EPS) {
      const int v = zu[i];
      if (lev[u] < lev[v]) {
        const Flow f = augment(v, t, min(limFlow, capa[i]));
        if (f > FLOW_EPS) { capa[i] -= f; capa[i ^ 1] += f; return f; }
      }
    }
    return 0;
  }
  bool bfs(int s, int t) {
    for (int u = 0; u < n; ++u) { see[u] = ptr[u]; lev[u] = -1; }
    auto head = que.begin(), tail = que.begin();
    for (lev[*tail++ = s] = 0; head != tail; ) {
      const int u = *head++;
      for (int i = ptr[u]; ~i; i = nxt[i]) if (capa[i] > FLOW_EPS) {
        const int v = zu[i];
        if (!~lev[v]) {
          lev[*tail++ = v] = lev[u] + 1;
          if (v == t) return true;
        }
      }
    }
    return false;
  }
  Flow run(int s, int t, Flow limFlow = FLOW_INF) {
    see.resize(n); lev.resize(n); que.resize(n);
    Flow flow = 0;
    for (; flow + FLOW_EPS < limFlow && bfs(s, t); ) {
      for (Flow f; (f = augment(s, t, limFlow - flow)) > FLOW_EPS; flow += f) {}
    }
    return flow;
  }
};

////////////////////////////////////////////////////////////////////////////////


constexpr int N = 10;

int SLen;
char S[110];

bool solve() {
  vector<int> win(N, 0);
  vector<pair<int, int>> ps;
  {
    int pos = 0;
    for (int i = 0; i < N-1; ++i) {
      for (int j = 0; j < N/2; ++j) {
        const int u = (j == 0) ? 0 : (1 + ((j - 1 - i + (N-1)) % (N-1)));
        const int v = 1 + (-j - 1 - i + 2*(N-1)) % (N-1);
// cerr<<i<<" "<<j<<": "<<u<<" "<<v<<endl;
        if (pos < SLen) {
          ++win[(S[pos] == '1') ? u : v];
        } else {
          if (u == 0 || v == 0) {
            ++win[0];
          } else {
            ps.emplace_back(u, v);
          }
        }
        ++pos;
      }
    }
  }
  const int psLen = ps.size();
  for (int p = 0; p < 1 << N; p += 2) if (__builtin_popcount(p) == 3) {
    MaxFlow<int> mf(2 + psLen + N);
    bool ok = true;
    for (int u = 1; u < N; ++u) {
      if (p >> u & 1) {
        mf.ae(2 + psLen + u, 1, psLen);
      } else {
        if (win[0] < win[u]) {
          ok = false;
          break;
        }
        mf.ae(2 + psLen + u, 1, win[0] - win[u]);
      }
    }
    if (!ok) continue;
    for (int i = 0; i < psLen; ++i) {
      mf.ae(0, 2 + i, 1);
      mf.ae(2 + i, 2 + psLen + ps[i].first, 1);
      mf.ae(2 + i, 2 + psLen + ps[i].second, 1);
    }
    const int res = mf.run(0, 1);
    if (res == psLen) {
      return true;
    }
  }
  return false;
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d", &SLen);
    scanf("%s", S);
    
    const bool ans = solve();
    puts(ans ? "YES" : "NO");
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}