#pragma GCC optimize("Ofast")

#include "bits/stdc++.h"


#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
//#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define each(x, a) for (auto &x : a)
#define ar array
#define vec vector
#define range(i, n) rep(i, n)

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;

int Bit(int mask, int b) { return (mask >> b) & 1; }

template<class T>
bool ckmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool ckmax(T &a, const T &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}

// [l, r)
template<typename T, typename F>
T FindFirstTrue(T l, T r, const F &predicat) {
    --l;
    while (r - l > 1) {
        T mid = l + (r - l) / 2;
        if (predicat(mid)) {
            r = mid;
        } else {
            l = mid;
        }
    }
    return r;
}


template<typename T, typename F>
T FindLastFalse(T l, T r, const F &predicat) {
    return FindFirstTrue(l, r, predicat) - 1;
}

const int INFi = 2e9;
const ll INF = 2e18;

int a[1 << 15];
int b[1 << 15];
vi p;

string solve(int up, int n) {
    int cnt = 0;
    rep(mask, 1 << n) cnt += a[up | mask];
    if (n == 1) {
        if (cnt == 2) {
            return "T";
        }
        if (cnt == 0) {
            return "F";
        }
        assert(cnt == 1 && a[up | 1]);
        string res;
        res += char('a' + p[0]);
        return res;
    }
    auto L = solve(up, n - 1);
    auto R = solve(up | (1 << (n - 1)), n - 1);
    if (L == R) {
        return L;
    }
    assert(L != "T" && R != "F");
    if (R == "T") {
        R.clear();
    } else {
        R += '&';
    }
    R += char('a' + p[n - 1]);
    if (R.size() > 1) R = "(" + R + ")";
    // L | R
    if (L == "F") {
        return R;
    }
    return "(" + L + "|" + R + ")";
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve() {
    int n; cin >> n;
    rep(mask, 1 << n) {
        char x; cin >> x;
        b[mask] = x - '0';
    }
    rep(mask, 1 << n) {
        rep(bit, n) {
            if (mask & (1 << bit)) {
                if (b[mask^(1<<bit)] > b[mask]) {
                    cout << "No\n";
                    return;
                }
            }
        }
    }
    cout << "Yes\n";
    p.resize(n);
    iota(all(p), 0);
    while (true) {
        shuffle(all(p), rng);
        rep(mask, 1 << n) {
            int mask2 = 0;
            rep(bit, n) if (mask & (1 << bit)) mask2 |= (1 << p[bit]);
            a[mask] = b[mask2];
        }
        auto result = solve(0, n);
        int cnt = count(all(result), '&') + count(all(result), '|');
        if (cnt > (1 << (n - 1)) + 10) {
            continue;
        }
        cout << result << '\n';
        return;
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(12) << fixed;
    int t = 1;

    cin >> t;
    rep(i, t) {
        solve();
    }
    return 0;
}