#include <bits/stdc++.h>
#define f first
#define s second
#define pii pair<int, int>
#define pb push_back
using namespace std;

int k, a, b, c;
string s;
string str;
bool works;
vector<int> teams;
vector<int> wins;
vector<pii> matches;

void recurse(int ind) {
  if(ind == 45){
    int greater = 0;
    for(int i = 1; i < 10; i++){
      if(wins[0] < wins[i]) greater++;
    }
    if(greater <= 3) works = true;
    //cout << a << " " << b << " " << c << " " << (greater <= 3) << endl;
    return;
  }

  if(str[ind] == '.'){
    recurse(ind+1);
    return;
  }
  
  wins[matches[ind].f]++;
  recurse(ind+1);
  wins[matches[ind].f]--;
  wins[matches[ind].s]++;
  recurse(ind+1);
  wins[matches[ind].s]--;
}

void setup_str(){
  str.clear();
  for(int i  = 0; i < k; i++){
    str.pb('.');
    if(s[i] == '1'){
      wins[matches[i].f]++;
    }else{
      wins[matches[i].s]++;
    }
  }

  for(int i = k; i < 45; i++){
    int x = matches[i].f;
    int y = matches[i].s;
    str.pb('.');
    if (not x or not y) wins[0]++;
    else if (x == a or x == b or x == c) wins[x]++;
    else if (y == a or y == b or y == c) wins[y]++;
    else str[i] = '?';
  }
  /*
  cout << str << endl;
  for(int i = 0; i < 10; i++){
    cout << wins[i] << " ";
  }
  cout << endl;
  */
}

void run() {
	cin >> k >> s;
	works = false;
	
	for (a = 1; a < 10; a++){
	  for (b = 1; b < 10; b++){
	    if (a == b) continue;
	    for (c = 1;c < 10; c++){
	      if(c == a || c== b) continue;
	      wins.assign(10, 0);
	      setup_str();
	      recurse(k);
	      
	    }
	  }
	}
	if(works) cout << "YES" << endl;
	else{
	  cout << "NO" << endl;
	}
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	teams.assign(10, 0);
	iota(teams.begin(),teams.end(),0);
	for(int i = 0; i < 9; i++){
	  for(int j = 0; j < 5; j++){
	    matches.pb({teams[j], teams[9-j]});
	  }
	  rotate(teams.begin()+1,teams.end()-1,teams.end());
	}
	int t; cin >> t; while (t--) run();
}