#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

void solve() {
  int k;
  scan(k);
  std::string s;
  scan(s);

  if (k <= 15) {
    print("YES");
    return;
  }

  std::array<int, 10> a;
  std::iota(a.begin(), a.end(), 0);
  std::vector<std::pair<int, int>> v;
  for (int _ = 9; _--;) {
    for (const int i : rep(5)) {
      v.emplace_back(a[i], a[9 - i]);
    }
    std::rotate(a.begin() + 1, a.end() - 1, a.end());
  }

  std::array<int, 10> wins{};
  for (const int i : rep(k)) {
    const auto [x, y] = v[i];
    if (s[i] == '1') {
      ++wins[x];
    } else {
      ++wins[y];
    }
  }

  std::vector<int> indices;
  for (const int i : rep(k, 45)) {
    if (i % 5 == 0) {
      assert(v[i].first == 0);
      ++wins[0];
    } else {
      indices.push_back(i);
    }
  }

  const int n = len(indices);
  for (const int mask : rep(1 << n)) {
    auto cur = wins;
    for (const int i : rep(n)) {
      const auto [x, y] = v[indices[i]];
      if (mask >> i & 1) {
        ++cur[x];
      } else {
        ++cur[y];
      }
    }
    int gt = 0;
    for (const int e : cur | views::drop(1)) {
      if (cur[0] < e) {
        ++gt;
      }
    }
    if (gt <= 3) {
      print("YES");
      return;
    }
  }

  print("NO");
}

}  // namespace

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cout << std::setprecision(DBL_DECIMAL_DIG);

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

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = std::forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = std::forward<U>(y), true);
}

template <std::signed_integral T = int>
T inf() {
  T ret;
  std::memset(&ret, 0x3f, sizeof(ret));
  return ret;
}

template <std::floating_point T>
T inf() {
  return std::numeric_limits<T>::infinity();
}

template <class T>
concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;

template <class T>
concept Tuple = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

istream& operator>>(istream& is, Tuple auto&& t) {
  return apply([&](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

ostream& operator<<(ostream& os, Range auto&& r) {
  for (string_view sep = ""; auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

ostream& operator<<(ostream& os, Tuple auto&& t) {
  const auto f = [&](auto&... xs) -> ostream& {
    [[maybe_unused]] string_view sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

}  // namespace std

void scan(auto&&... xs) { std::cin >> std::tie(xs...); }
void print(auto&&... xs) { std::cout << std::tie(xs...) << '\n'; }

template <class F>
class fix {
 public:
  explicit fix(F f) : f_(std::move(f)) {}

  decltype(auto) operator()(auto&&... xs) const {
    return f_(std::ref(*this), std::forward<decltype(xs)>(xs)...);
  }

 private:
  F f_;
};

inline auto rep(int l, int r) { return std::views::iota(std::min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }

using namespace std::literals;

namespace ranges = std::ranges;
namespace views = std::views;

using i64 = std::int64_t;

#define len(...) static_cast<int>(ranges::size(__VA_ARGS__))

#endif  // __INCLUDE_LEVEL__