#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(),(v).end()
#define pb(a) push_back(a)
#define rep(i, n) for(int i=0;i<n;i++)
#define foa(e, v) for(auto&& e : v)
using ll = long long;
const ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);
#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;

void solve() {
    int n;
    cin >> n;
    string s; cin >> s;
    bool ng = 0;
    rep(bit, 1 << n) {
        rep(i, n) {
            if(bit >> i & 1) continue;
            if(s[bit] == '1' and s[bit | (1 << i)] == '0') ng = 1;
        }
    }
    if(ng) {
        cout << "No" << endl;
        return ;
    }
    cout << "Yes" << endl;
    if(count(all(s), '0') == 0) {
        cout << "T" << endl;
        return;
    }
    if(count(all(s), '1') == 0) {
        cout << "F" << endl;
        return;
    }
    vector dp(1 << n, vector(n, 0)), dp1(1 << n, vector(n, 0));
    auto dfs = [&](auto dfs, int bits, int i) -> void {
        if(i == n - 1) {
            if(s[bits | (1 << i)] == s[bits]) dp[bits][i] = dp1[bits][i] = 0;
            else dp[bits][i] = dp1[bits][i] = 1;
            return; 
        }
        dfs(dfs, bits | (1 << i), i + 1);
        dfs(dfs, bits, i + 1);
        
        
        if(dp[bits | (1 << i)][i + 1] == 0 and dp[bits][i + 1] == 0) {
            if(s[bits] == s[bits | (1 << i)]) {
                dp[bits][i] = 0;
                return;
            }
        }
        int m = n - i - 1;
        bool f = 0;
        rep(bit, (1 << m)) {
            if(s[bits | (bit << (i + 1))] != s[bits | (bit << (i + 1)) | (1 << i)]) f = 1;
        }
        if(f) dp1[bits][i] = 1;
        
        dp[bits][i] = 1;
        return;
    };
    dfs(dfs, 0, 0);
    auto dfs1 = [&](auto dfs1, int bits, int i) -> void {
        if(i == n - 1) {
            cout << char('a' + i);
            return;
        }

        if(!dp1[bits][i]) {
            dfs1(dfs1, bits, i + 1);
            return;
        }


        if(dp[bits][i + 1]) cout << '(';
        if(dp[bits | (1 << i)][i + 1]) {
            cout << '(';
            cout << char('a' + i);
            cout << '&';
            dfs1(dfs1, bits | (1 << i), i + 1);
            cout << ')';
        } else {
            cout << char('a' + i);
        }
        
        if(dp[bits][i + 1]) {
            cout << '|';
            dfs1(dfs1, bits, i + 1);
            cout << ')';
        } 
    };
    dfs1(dfs1, 0, 0);
    cout << endl;
}
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    rep(i, t) solve();
    return 0;
}