#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <random>
#include <ctime>
#include <chrono>
#include <numeric>
#include <iomanip>
#include <cassert>

typedef long long ll;
typedef double lf;
typedef unsigned long long ull;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = (1 << 15) + 5;

int n;
string val;

bool f[MAXN];

inline string Or(string x, string y)
{
    if (x == "T" || y == "T") return "T";
    if (x == "F") return y;
    if (y == "F") return x;
    return "(" + x + "|" + y + ")";
}
inline string And(string x, string y)
{
    if (x == "F" || y == "F") return "F";
    if (x == "T") return y;
    if (y == "T") return x;
    return "(" + x + "&" + y + ")";
}
string Solve(int u, int l, int r)
{
    string cur = "a"; cur[0] += n - u - 1;
    if (u == n) return f[l] ? "T" : "F";
    int mid = l + r >> 1;
    return Or(Solve(u + 1, l, mid), And(Solve(u + 1, mid, r), cur));
}

int main()
{
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    int T;
    cin >> T;
    while (T--)
    {
        cin >> n >> val;
        bool flag = 0;
        for (int i = 0; i < n; i++)
            for (int j = 0; j < (1 << n); j++)
                if (j >> i & 1) flag |= (val[j] == '0' && val[j ^ (1 << i)] == '1');
        if (flag) { cout << "No\n"; continue; }
        for (int i = 0; i < (1 << n); i++)
        {
            if (val[i] == '0') { f[i] = 0; continue; }
            f[i] = 1;
            for (int j = 0; j < n; j++)
                if (i >> j & 1) f[i] &= (val[i ^ (1 << j)] == '0');
        }
        string ans = Solve(0, 0, 1 << n);
        cout << "Yes\n" << ans << "\n";
    }
    return 0;
}