#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 14349000;

char st[32800];
bool p[1 << 15], t[maxn], t2[maxn], t3[maxn];
int f[maxn], c[maxn], mi[20], w[20], n;
pii pre[maxn];

inline void dec(int x, int *w)
{
    for (int i = 0; i < n; i++) w[i] = x % 3, x /= 3;
}

inline int hsh(int *w)
{
    int nw = 0;
    for (int i = n - 1; ~i; i--) nw = nw * 3 + w[i];
    return nw;
}

inline int hs2(int *w)
{
    int nw = 0;
    for (int i = 0; i < n; i++) nw |= ((w[i] == 2) << i);
    return nw;
}

inline bool hs3(int *w)
{
    bool nw = 0;
    for (int i = 0; i < n; i++) nw |= (w[i] == 0);
    return nw;
}

void solve(int s)
{
    int x = pre[s].first, y = pre[s].second;
    if (x == -1 && y == -1) return;
    if (y == -1) return solve(x), void();
    char ch = (char)('a' + c[s]);
    if (x == -1)
    {
        if (!t2[y]) return cout << ch, void();
        cout << '(' << ch << '&';
        solve(y); cout << ')'; return;
    }
    cout << '('; solve(x); cout << '|';
    if (t2[y]) cout << '(' << ch << '&', solve(y), cout << "))";
    else cout << ch << ')';
}

void work()
{
    cin >> n >> st;
    int N = 1 << n, M = 1;
    mi[0] = 1; for (int i = 1; i <= n; i++) mi[i] = mi[i - 1] * 3; M = mi[n];
    for (int s = 0; s < N; s++) p[s] = 0;
    for (int s = 0; s < M; s++) f[s] = 0;

    for (int s = 0; s < N; s++)
    {
        bool F = (st[s] == '1'), F2 = 1;
        for (int i = 0; i < n; i++)
            if ((s >> i) & 1) F2 &= (st[s ^ (1 << i)] == '0');
        if (F && F2) p[s] = t[s] = 1;
        if (!F && !F2) return cout << "No\n", void();
    }
    if (p[0]) return cout << "Yes\nT\n", void();
    if (st[N - 1] != '1') return cout << "Yes\nF\n", void();
    for (int s = M - 1; ~s; s--)
    {
        dec(s, w); t[s] = t2[s] = 0, t3[s] = hs3(w); bool F = 0;
        for (int i = 0; i < n; i++)
            if (!w[i])
            {
                t[s] |= t[s + mi[i]], t2[s] |= t2[s + mi[i]];
                t[s] |= t[s + (mi[i] << 1)], t2[s] |= t[s + (mi[i] << 1)];
                F = 1; break;
            }
        if (!F) t[s] = p[hs2(w)];
    }
    
    for (int s = M - 1; ~s; s--)
    {
        bool Fl = 0;
        dec(s, w); f[s] = 0x3f3f3f3f, pre[s] = make_pair(-1, -1);
        for (int i = 0; i < n; i++)
            if (!w[i])
            {
                int res = f[s + mi[i]], F2 = t[s + mi[i]];
                res += f[s + (mi[i] << 1)]; if (t[s + (mi[i] << 1)]) res += t3[s + (mi[i] << 1)] + F2;
                Fl = 1;
                if (f[s] > res)
                {
                    f[s] = res, pre[s] = make_pair(-1, -1), c[s] = i;
                    if (t[s + mi[i]]) pre[s].first = s + mi[i];
                    if (t[s + (mi[i] << 1)]) pre[s].second = s + (mi[i] << 1);
                }
            }
        if (!Fl) f[s] = 0;
    }
    cout << "Yes\n";
    solve(0); cout << "\n";
}

int main()
{
    ios::sync_with_stdio(false), cin.tie(0);

    int T; cin >> T;
    while (T--) work();
    return 0;
}