#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())
#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())

using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;

template <typename T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T, typename U> T ceil(T x, U y) {
    assert(y != 0);
    if (y < 0)
        x = -x, y = -y;
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <typename T, typename U> T floor(T x, U y) {
    assert(y != 0);
    if (y < 0)
        x = -x, y = -y;
    return (x > 0 ? x / y : (x - y + 1) / y);
}
template <typename T> int popcnt(T x) {
    return __builtin_popcountll(x);
}
template <typename T> int topbit(T x) {
    return (x == 0 ? -1 : 63 - __builtin_clzll(x));
}
template <typename T> int lowbit(T x) {
    return (x == 0 ? -1 : __builtin_ctzll(x));
}

template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << "P(" << p.first << ", " << p.second << ")";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
    os << "{";
    for (int i = 0; i < vec.size(); i++) {
        os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    os << "{";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")";
        itr++;
        if (itr != map_var.end())
            os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {
    os << "{";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr;
        ++itr;
        if (itr != set_var.end())
            os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
#ifdef LOCAL
#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)
#else
#define show(...) true
#endif
template <typename T> void _show(int i, T name) {
    cerr << '\n';
}
template <typename T1, typename T2, typename... T3>
void _show(int i, const T1 &a, const T2 &b, const T3 &...c) {
    for (; a[i] != ',' && a[i] != '\0'; i++)
        cerr << a[i];
    cerr << ":" << b << " ";
    _show(i + 1, a, c...);
}

/**
 * @brief template
 */

ll Counting(string S) {
    int COUNT = 0;
    for (char C : S) {
        if (C == '&' || C == '|') COUNT++;
    }
    return COUNT;
}

void Solve() {
    int N;
    cin >> N;
    vector<int> B(1<<N);
    {
        string S;
        cin >> S;
        rep(i,0,1<<N) B[i] = S[i]-'0';
    }
    auto A = B;
    {
        rep(i,0,N) {
            rep(j,0,1<<N) {
                if (j&(1<<i)) continue;
                A[j|(1<<i)] += A[j];
            }
        }
        rep(i,0,1<<N) {
            if (B[i] == 0 && A[i] > 0) {
                cout << "No" << endl;
                return;
            }
        }
    }
    if (A.back() == 0) {
        cout << "Yes" << endl;
        cout << 'F' << endl;
        return;
    }
    if (A.back() == (1<<N)) {
        cout << "Yes" << endl;
        cout << 'T' << endl;
        return;
    }
    vector<int> V;
    rep(i,0,1<<N) if (A[i] == 1) V.push_back(i);
    auto DFS = [&](auto self, int Dep, vector<int>& X) -> string {
        char C = 'a' + (Dep-1);
        if (X.empty()) return "F";
        if (X[0] == 0) return "T";
        vector<int> XL, XR;
        int MID = 1<<(Dep-1);
        for (auto x : X) {
            if (x < MID) XL.push_back(x);
            else XR.push_back(x-MID);
        }
        string SL = self(self, Dep-1, XL);
        string SR = self(self, Dep-1, XR);
        if (SL == "F") {
            if (SR == "F") {
                return "F";
            }
            else if (SR == "T") {
                return string(1,C);
            }
            else {
                return '(' + SR + '&' + C + ')';
            }
        }
        else if (SL == "T") {
            return "T";
        }
        else {
            if (SR == "F") {
                return SL;
            }
            else if (SR == "T") {
                return '(' + SL + '|' + C + ')';
            }
            else {
                return '(' + SL + '|' + '(' + SR + '&' + C + ')' + ')';
            }
        }
    };
    cout << "Yes" << endl;
    string ANS = DFS(DFS,N,V);
    cout << ANS << endl;
    //cout << Counting(ANS) << endl;
}

int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
int _;
cin >> _;
while(_--) {
    Solve();
}
}