B_Chess_Tournament.cpp

#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define fo(i,n) for(ll i=0;i<n;i++)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define all(v) v.begin(), v.end()
#define sortall(v) sort(all(v))
#define sortalld(v) sort(all(v),greater<ll>())
typedef pair<int, int>	pii;
typedef pair<ll, ll>	pl;
typedef vector<int> veci;
typedef vector<ll>  vecll;
typedef vector<pii>		vpii;
typedef vector<pl>		vpl;
const int mod = 1000000007;
int pow(int base, int exp) {base %= mod;int result = 1;while (exp > 0) {if (exp & 1) result = ((ll)result * base) % mod;base = ((ll)base * base) % mod;exp >>= 1;}return result;}
int T, P, Q, R, X, Y, U, V, N,M;
ll t, p, q, r, x, y, u, v, n, m,k;
int main() {
    ios_base::sync_with_stdio(0);
    cin >> t;
    while(t--)
    {
        cin >> n;
        string s;
        cin >> s;
        ll c1 = 0, c2 = 0;
        vector<int> ci;
        fo(i,n)
        {
            if(s[i]=='1')
                c1++;
                else
                {
                    ci.push_back(i);
                    c2++;
                }
                    
        }
       if(c2==1 || c2==2)
       {
           cout << "NO" << endl;
           continue;
       }
       vector<string> v(n, string(n, '='));
       for (int i = 0; i < n;i++)
       {
           v[i][i] = 'X';
       }
       for (int i = 0; i < c2;i++)
       {
           int x = ci[i], y = ci[(i + 1)%c2];
           v[x][y] = '+';
           v[y][x] = '-';
       }
       cout << "YES" << endl;
       for (int i = 0; i < n;i++)
       {
        
           cout<<v[i] << endl;
       }
     
    }
}