#include <bits/stdc++.h>

using namespace std;

string s, tmp;

string solve(int a, int l, int r) {
  int c0 = 0, c02 = 0, c1 = 0, c12 = 0;
  for (int i = l; i < (l | 1 << a); ++i) {
    c0 += s[i] == 1;
    c02 += s[i] == -1;
    c1 += s[i | 1 << a] == 1;
    c12 += s[i | 1 << a] == -1;
  }
  if (c0 && c1) return '(' + solve(a - 1, l, l | 1 << a) + "|(" + char('a' + a) + '&' + solve(a - 1, l | 1 << a, r) + "))";
  else if (!c0 && !c1) return "F";
  else if (c0 + c02 == 1 << a) return "T";
  else if (c0) return solve(a - 1, l, l | 1 << a);
  else if (c1 + c12 == 1 << a) return ""s + char('a' + a);
  else if (c1) return "("s + char('a' + a) + '&' + solve(a - 1, l | 1 << a, r) + ')';
  else return "F";
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  mt19937 rng(23123123);
  for (int tc = (cin >> tc, tc); tc--; ) {
    int n, k; cin >> n;// >> k;
    s.resize(1 << n);
    cin >> s;
    for (auto& c: s) c -= '0';
//    for (int i = 0; i < 1 << n; ++i) s[i] = __builtin_popcount(i) >= k;
    bool ok = 1;
    for (int i = 0; i < 1 << n; ++i) if (s[i])
    for (int j = 0; j < n; ++j) ok &= s[i | 1 << j];
    if (!ok) { cout << "No\n"; continue; }
    for (int i = 0; i < 1 << n; ++i) if (s[i])
    for (int j = 0; j < n; ++j) if (s[i | 1 << j] && !(i >> j & 1)) s[i | 1 << j] = -1;
    cout << "Yes\n";
    string pref = "", suf = "";
    vector<int> var(n);
    for (int i = 0; i < n; ++i) var[i] = i;
    string t;
    while (t = pref + solve(n - 1, 0, 1 << n), count(t.begin(), t.end(), '&') + count(t.begin(), t.end(), '|') > (1 << n - 1) + 10) {
      shuffle(var.begin(), var.end(), rng);
      tmp.assign(1 << n, '\1');
      int m = rng() % (1 << n - 1) | 1 << n - 1;
      for (int i = 0, j = -1; i < n; ++i) if (m & 1 << i) {
        for (int k = 0; k < 1 << n; ++k) if (!(k & (1 << i + 1) - (1 << j + 1))) tmp[k] = 0;
        j = i;
      }
      int ok = 1, opt = 0;
      for (int k = 0; k < 1 << n; ++k) if (tmp[k] && !s[k]) ok = 0; else if (tmp[k] && s[k] == 1) ++opt;
      if (!ok || opt < n - 1) continue;
      for (int k = 0; k < 1 << n; ++k) if (tmp[k] && s[k]) s[k] = -1;
      string cur0;
      for (int i = 0, j = -1; i < n; ++i) if (m & 1 << i) {
        string cur1;
        for (int k = j; k++ < i; ) {
          if (cur1.size()) cur1 = '(' + cur1 + '|' + char('a' + k) + ')';
          else cur1 += char('a' + k);
        }
        if (cur0.size()) cur0 = '(' + cur0 + '&' + cur1 + ')';
        else cur0 = cur1;
        j = i;
      }
      if (pref.size()) pref = '(' + pref + cur0 + ')' + '|';
      else pref = '(' + cur0 + '|';
//      cout << t << '\n';
//      cout << count(t.begin(), t.end(), '&') + count(t.begin(), t.end(), '|') << ' ' << opt << '\n';
    }
    if (pref.size()) t += ')';
//    cout << count(t.begin(), t.end(), '&') + count(t.begin(), t.end(), '|') << '\n';
    cout << t << '\n';
  }
}