#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")


int N;
char S[(1 << 15) + 10];

string rec(const vector<int> &us) {
  if (us.size() == 0) {
    return "F";
  }
  if (us.size() == 1) {
    string ret = "T";
    for (int e = 0; e < N; ++e) if (us[0] & 1 << e) {
      const char c = 'a' + e;
      if (ret == "T") {
        ret = string() + c;
      } else {
        ret = "(" + ret + "&" + c + ")";
      }
    }
    return ret;
  }
  vector<int> freq(N, 0);
  for (const int u : us) {
    for (int e = 0; e < N; ++e) if (u & 1 << e) ++freq[e];
  }
  int em = 0;
  for (int e = 0; e < N; ++e) if (freq[em] < freq[e]) em = e;
  assert(freq[em]);
  vector<int> uss[2];
  for (const int u : us) uss[u >> em & 1].push_back(u & ~(1 << em));
  string res0 = rec(uss[0]);
  string res1 = rec(uss[1]);
  const char cm = 'a' + em;
  res1 = (res1 == "T") ? (string() + cm) : (string() + "(" + cm + "&" + res1 + ")");
  if (uss[0].size()) {
    if (uss[1].size()) {
      return "(" + res0 + "|" + res1 + ")";
    } else {
      return res0;
    }
  } else {
    if (uss[1].size()) {
      return res1;
    } else {
      assert(false);
    }
  }
}
string solve() {
  vector<int> us;
  for (int u = 0; u < 1 << N; ++u) if (S[u] == '1') {
    bool ok = true;
    for (int e = 0; e < N; ++e) if (u & 1 << e) ok = ok && (S[u ^ 1 << e] == '0');
    if (ok) {
      us.push_back(u);
    }
  }
// cerr<<"us = "<<us<<endl;
  if (us == vector<int>{0}) return "T";
  const string ans = rec(us);
  return ans;
}

void flip() {
  for (int u = 0; u < 1 << N; ++u) S[u] ^= 1;
  reverse(S, S + (1 << N));
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d", &N);
    scanf("%s", S);
    
    bool mono = true;
    for (int u = 0; u < 1 << N; ++u) if (S[u] == '1') {
      for (int e = 0; e < N; ++e) if (!(u & 1 << e)) {
        mono = mono && (S[u | 1 << e] == '1');
      }
    }
    if (!mono) {
      puts("No");
      continue;
    }
    
    string ans[2];
    ans[0] = solve();
    flip();
    ans[1] = solve();
    flip();
    
    for (char &c : ans[1]) {
      if (c == 'T' || c == 'F') c ^= 'T' ^ 'F';
      if (c == '&' || c == '|') c ^= '&' ^ '|';
    }
// for(int h=0;h<2;++h)cerr<<"ans["<<h<<"] = "<<ans[h]<<endl;
    
    int cost[2] = {};
    for (int h = 0; h < 2; ++h) {
      for (const char c : ans[h]) {
        if (c == '&' || c == '|') ++cost[h];
      }
    }
    int hm = 0;
    for (int h = 0; h < 2; ++h) if (cost[hm] > cost[h]) hm = h;
    puts("Yes");
    puts(ans[hm].c_str());
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}