#include<iostream>
#include<tuple>
#include<vector>
#include<cassert>
#include<random>
using namespace std;
int n;
string S;
string ans;
void dfs(vector<int>ex,int i)
{
	assert(!ex.empty());
	assert(i>=0);
	if(i==0)
	{
		assert(ex.size()==1);
		assert(ex[0]==0||ex[0]==1);
		if(ex[0]==0)ans+='T';
		else ans+='a';
		return;
	}
	vector<int>l,r;
	for(int u:ex)
	{
		if(u>>i&1)r.push_back(u^1<<i);
		else l.push_back(u);
	}
	char a='a'+i;
	int nrest=i-1;
	if(l.empty())
	{
		if(r.size()==1&&r[0]==0)
		{
			ans+=a;
		}
		else
		{
			ans+='(';
			ans+=a;
			ans+='&';
			dfs(r,nrest);
			ans+=')';
		}
	}
	else if(r.empty())dfs(l,nrest);
	else
	{
		ans+='(';
		dfs(l,nrest);
		ans+='|';
		if(r.size()==1&&r[0]==0)ans+=a;
		else
		{
			ans+='(';
			ans+=a;
			ans+='&';
			dfs(r,nrest);
			ans+=')';
		}
		ans+=')';
	}
}
bool solve()
{
	assert(S.size()==(1<<n));
	for(int i=0;i<1<<n;i++)if(S[i]=='1')
	{
		for(int j=0;j<n;j++)if(S[i|1<<j]=='0')return false;
	}
	vector<int>ex;
	for(int i=0;i<1<<n;i++)if(S[i]=='1')
	{
		bool fn=false;
		for(int j=0;j<n;j++)if(i>>j&1&&S[i^1<<j]=='1')fn=true;
		if(!fn)ex.push_back(i);
	}
	if(ex.empty())
	{
		ans="F";
		return true;
	}
	else
	{
		ans="";
		dfs(ex,n-1);
		int cnt=0;
		for(char c:ans)if(c=='|'||c=='&')cnt++;
		assert(cnt<=(1<<n-1)+10);
	}
	return true;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	/*
	for(n=1;n<=15;n++)
	{
		for(int k=0;k<=n+1;k++)
		{
			S=string(1<<n,'0');
			for(int i=0;i<1<<n;i++)if(__builtin_popcount(i)>=k)S[i]='1';
			cout<<n<<" "<<k<<endl;
			assert(solve());
		}
	}
	mt19937 rng;
	while(true)
	{
		n=rng()%15+1;
		S=string(1<<n,'0');
		for(int i=0;i<1<<n;i++)if(rng()%10==0)S[i]='1';
		for(int i=0;i<1<<n;i++)if(S[i]=='1')
		{
			for(int j=0;j<n;j++)S[i|1<<j]='1';
		}
		cout<<n<<endl;
		assert(solve());
	}
	*/
	int T;cin>>T;
	for(;T--;)
	{
		cin>>n>>S;
		if(!solve())cout<<"No\n";
		else
		{
			cout<<"Yes\n";
			cout<<ans<<"\n";
		}
	}
}