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

#define rep(i, l, r) for(ll i = l; i < r; i++)
#define all(ar) begin(ar), end(ar)

const ll a[5] = {
    0b00000000000000001111111111111111, 0b00000000111111110000000011111111,
    0b00001111000011110000111100001111, 0b00110011001100110011001100110011,
    0b01010101010101010101010101010101};

unordered_map<ll, string> st;
vector<vector<ll>> mask(14);

bool built = false;

void sol(int n, char top) {
    int sz = 1 << n;
    rep(i, 5 - n, 5) {
        mask[1].push_back(a[i]);
        st[a[i]] = top;
        top++;
    }
    st[0b11111111111111111111111111111111] = "T";
    st[0] = "F";
    rep(i, 2, 14) {
        rep(j, 1, i) {
            int k = i - j;
            if(j > k) break;
            for(ll x : mask[j])
                for(ll y : mask[k]) {
                    if(!st.count(x | y)) {
                        st[x | y] = "(" + st[x] + "|" + st[y] + ")";
                        mask[i].push_back(x | y);
                    }
                    if(!st.count(x & y)) {
                        st[x & y] = "(" + st[x] + "&" + st[y] + ")";
                        mask[i].push_back(x & y);
                    }
                }
        }
    }
    built = true;
}

bool f(int n, string s, char c, string &ans) {
    if(n >= 6) {
        int sz = s.size();
        int half = sz / 2;
        ans += "(";
        bool l = f(n - 1, s.substr(0, half), c + 1, ans);
        if(l) return true;
        ans += ")|(";
        ans += c;
        ans += "&(";
        bool r = f(n - 1, s.substr(half), c + 1, ans);
        if(r) return true;
        ans += "))";
        return false;
    } else {
        while(s.size() < 32u) s += s;
        ll x = stoll(s, nullptr, 2);
        if(!st.count(x)) return true;
        ans += st[x];
        return false;
    }
}

void solve() {
    int n;
    cin >> n;
    string s;
    cin >> s;

    string ans;
    if(f(n, s, 'a', ans)) {
        cout << "No" << endl;
        return;
    }

    for(char &c : ans) {
        if(isdigit(c)) {
            c -= '0';
            c += 'a';
            c += n - 5;
        }
    }

    for(char &c : ans) {
        if('a' <= c && c <= 'z') {
            c = 'a' + 'a' + n - 1 - c;
        }
    }

    cout << "Yes" << endl;
    cout << ans << endl;
}

int main() {
    sol(5, '0');
    int t = 1;
    cin >> t;
    while(t--) {
        solve();
    }
}