#include <bits/stdc++.h>

using namespace std;

int n;
bool fa[17][1<<16];
bool fo[17][1<<16];

string fatina(int bs, int i) {
	string alpha = "";
	alpha+=('a'+i);
	//cerr<<i<<' '<<bs<<' '<<fa[i+1][bs]<<' '<<fo[i+1][bs]<<endl;
	if(fa[i+1][bs]==1) return "T";
	if(fo[i+1][bs]==0) return "F";
	string l = fatina(bs<<1, i-1); // x=0
	string r = fatina(1|(bs<<1), i-1); //x=1
	if(l=="F" && r=="T") return alpha;
	if(l==r) return l;
	if(l=="F") return alpha+"&("+r+")";
	if(r=="T") return "("+l+")|"+alpha;
	return "("+l+")|("+alpha+"&("+r+"))";
}

void solve() {
	string sf;
	cin>>n>>sf;
	for(int i=0; i<(1<<n); ++i) fa[0][i]=fo[0][i]=(sf[i]=='1');
	for(int i=0; i<(1<<n); ++i) if(fa[0][i]) for(int j=0; j<n; ++j) {
		if(!fa[0][i|(1<<j)]) {
			cout<<"No\n";
			return;
		}
	}
	for(int j=1; j<=n; ++j) {
		for(int i=0; 2*i+1<(1<<n); ++i) {
			fa[j][i] = fa[j-1][2*i]&fa[j-1][2*i+1];
			fo[j][i] = fo[j-1][2*i]|fo[j-1][2*i+1];
		}
	}
	cout<<"Yes\n"<<fatina(0,n-1)<<'\n';
}

signed main() {
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	int t;
	cin>>t;
	while(t--) solve();
	return 0;
}