#include <cstdio>
#include <cassert>
#include <string>

const int N = 1 << 15;
int t, n;
bool ok = 1;
char s[N + 1];

std::string run(int mask = 0, int rest = 0) {
	if (mask + 1 == (1 << n)) {
		if (s[rest] == '0') return "F";
		return "T";
	}
	int best = -1, mx_diff = 0;
	for (int i = 0; i < n; ++i) if (mask >> i & 1 ^ 1) {
		int opp = (1 << n) - 1 ^ mask ^ (1 << i), diff = 0;
		for (int j = opp;; j = (j - 1) & opp) {
			if (s[rest | j | (1 << i)] != s[rest | j]) {
				if (s[rest | j] == '1') ok = 0;
				++diff;
			}
			if (!j) break;
		}
		if (diff > mx_diff) {
			mx_diff = diff;
			best = i;
		}
	}
	if (mx_diff == 0) {
		if (s[rest] == '0') return "F";
		return "T";
	}
	std::string X = run(mask | 1 << best, rest), Y = run(mask | 1 << best, rest | 1 << best);
	if (X == "T") return "T";
	if (Y == "F") return X;
	if (X == "F") {
		if (Y == "T") return std::string() + char('a' + best);
		return '(' + Y + '&' + char('a' + best) + ')';
	}
	if (Y == "T") return '(' + X + '|' + char('a' + best) + ')';
	return '(' + X + "|(" + char('a' + best) + '&' + Y + "))";
}

int main() {
	scanf("%d", &t);
	while (t--) {
		scanf("%d", &n);
		scanf("%s", s);
		ok = 1;
		auto ans = run();
		if (ok) {
			printf("Yes\n");
			int op = 0;
			for (int i = 0; i < ans.size(); ++i) if (ans[i] == '&' || ans[i] == '|') ++op;
			assert(op <= (1 << n - 1) + 10);
			printf("%s\n", ans.c_str());
		} else printf("No\n");
	}
	return 0;
}