#include<bits/stdc++.h>
using namespace std;
int n;
string s;
bool check(){
    for(int i=0;i<(1<<n);i++) if(s[i]=='0'){
        for(int j=i;j;j=(j-1)&i) if(s[((j-1)&i)]=='1'){
            return false;
        }
    }
    return true;
}
void solve(int now,vector<int> &t){
    vector<int> t0,t1;
    for(int i:t){
        if(i&(1<<now)){
            t1.push_back(i);
        }
        else{
            t0.push_back(i);
        }
    }
    t.clear();
    if(now+1==n){
        if(t0.size()){
            cout<<"T";
        }
        else{
            cout<<char('a'+now);
        }
        return;
    }
    if(t0.size()&&t1.size()){
        cout<<"(";
        solve(now+1,t0);
        cout<<"|("<<char('a'+now)<<"&";
        solve(now+1,t1);
        cout<<"))";
    }
    else if(t0.size()){
        solve(now+1,t0);
    }
    else{
        cout<<"("<<char('a'+now)<<"&";
        solve(now+1,t1);
        cout<<")";
    }
}
int main(){
    cin.tie(0)->sync_with_stdio(0);
    int T;
    cin>>T;
    while(T--){
        cin>>n>>s;
        if(!check()){
            cout<<"No\n";
            continue;
        }
        cout<<"Yes\n";
        vector<int> t;
        for(int i=0;i<(1<<n);i++) if(s[i]=='1'){
            bool flag=1;
            for(int j=i;j;j=(j-1)&i) if(s[((j-1)&i)]=='1'){
                flag=0;
                break;
            }
            if(flag){
                t.push_back(i);
            }
        }
        solve(0,t);
        cout<<"\n";
    }
    return 0;
}