#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define ckmin(a, b) (a) = ((b) < (a) ? (b) : (a))
#define ckmax(a, b) (a) = ((b) > (a) ? (b) : (a))

static int global_n;

inline vector<int> Subset(int S) {
    vector<int> v;
    for (int T = S; T; T = (T - 1) & S) v.push_back(T ^ S);
    return v;
}

inline vector<int> Bitset(int S) {
    vector<int> v;
    for (int i = 0; i < global_n; i++) if (S >> i & 1) v.push_back(i);
    return v;
}
inline string And_merge(const string &a, const string &b) {
    string s;
    if (a.empty()) return b;
    if (b.empty()) return a;
    s += '(';
    s += a;
    s += '&';
    s += b;
    s += ')';
    return s;
}
inline string Or_merge(const string &a, const string &b) {
    string s;
    if (a.empty()) return b;
    if (b.empty()) return a;
    s += '(';
    s += a;
    s += '|';
    s += b;
    s += ')';
    return s;
}
template<class T>
void debug(vector<T>v) {
    for (int x : v) cout << x << ' ';
    cout << '\n';
}

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

    const int N = 1 << n;
    if (table == string(N, '0')) {
        cout << "Yes\nF\n";
        return;
    }
    if (table == string(N, '1')) {
        cout << "Yes\nT\n";
        return;
    }


    global_n = n;

    vector<int> expr;
    for (int S = 0; S < N; S++) {
        bool has_sub = false;
        for (int &T: Subset(S)) {
            if (table[T] == '1') has_sub = true;
        }
        if (!has_sub && table[S] == '1') expr.push_back(S);

        if (has_sub && table[S] == '0') {
            cout << "No\n";
            return;
        }
    }

    function<string(vector<int>, int)> Get_expression = [&](vector<int>expr, int I) -> string {
        if (I == n) {
            return "";
        }
        vector<int> f1, f2;
        for (int S : expr) ((S >> I & 1) ? f1 : f2).push_back(S);

        // cout << "expr,now:\n";
        // debug(expr);
        // cout << "debug f1 f2:\n";
        // debug(f1);
        // debug(f2);
        // cout << "debug,end\n\n";

        if (f1.empty()) {
            return Get_expression(f2, I + 1);
        }
        if (f2.empty()) {
            return And_merge(string(1, 'a' + I), Get_expression(f1, I + 1));
        }
        return Or_merge(And_merge(string(1, 'a' + I), Get_expression(f1, I + 1)), Get_expression(f2, I + 1));
    };

    cout << "Yes\n";
    cout << Get_expression(expr, 0) << '\n';
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int tc;
    cin >> tc;
    while (tc--) {
        solve();
    }

    return 0;
}