description: A chess tournament will be held soon, where n chess players will take part. Every participant will play one game against every other participant. Each game ends in either a win for one player and a loss for another player, or a draw for both players.
  
  Each of the players has their own expectations about the tournament, they can be one of two types:
  
    1. a player wants not to lose any game (i. e. finish the tournament with zero losses); 
    2. a player wants to win at least one game. 
  
  
  
  You have to determine if there exists an outcome for all the matches such that all the players meet their expectations. If there are several possible outcomes, print any of them. If there are none, report that it's impossible.
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 200) — the number of test cases.
  
  The first line of each test case contains one integer n (2 ≤ n ≤ 50) — the number of chess players.
  
  The second line contains the string s (|s| = n; s_i ∈ \{1, 2\}). If s_i = 1, then the i-th player has expectations of the first type, otherwise of the second type.
  
  Output
  
  For each test case, print the answer in the following format:
  
  In the first line, print NO if it is impossible to meet the expectations of all players.
  
  Otherwise, print YES, and the matrix of size n × n in the next n lines.
  
  The matrix element in the i-th row and j-th column should be equal to:
  
    * +, if the i-th player won in a game against the j-th player; 
    * -, if the i-th player lost in a game against the j-th player; 
    * =, if the i-th and j-th players' game resulted in a draw; 
    * X, if i = j. 
  
  Example
  
  Input
  
  
  3
  3
  111
  2
  21
  4
  2122
  
  
  Output
  
  
  YES
  X==
  =X=
  ==X
  NO
  YES
  X--+
  +X++
  +-X-
  --+X
solution: import java.io.DataInputStream;
  import java.io.FileInputStream;
  import java.io.IOException;
  import java.util.AbstractMap;
  import java.util.Comparator;
  import java.util.HashMap;
  import java.util.Map;
  import java.util.Map.Entry;
  import java.util.PriorityQueue;
  import java.util.*;
  import java.io.*;
  
  // Java Template Pramod Hosahalli...
  public class Solution {
  
  	//static FastReader in = new FastReader();
  	static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
  	static int mod = 1000000007;
  
  	private static void go() throws Exception {
  		int n = pi(in.readLine());
  		char[] ch1 = in.readLine().toCharArray();
  		char[][] ch = new char[n][n];
  		List<Integer> s1 = new ArrayList<>();
  		List<Integer> s2 = new ArrayList<>();
  		
  		for(int i = 0; i < ch.length; i++){
  			if(ch1[i] == '1')s1.add(i);
  			else s2.add(i);
  		}
  
  		for(int i = 0; i < s1.size(); i++){
  			for(int j = i; j < s1.size(); j++){
  				int x = s1.get(i);
  				int y = s1.get(j);
  				
  				ch[x][x] = 'X';
  				ch[y][y] = 'X';
  				
  				if(x!=y)
  				ch[x][y] = ch[y][x] = '=';
  			}
  		}
  
  		for(int i = 0; i < s1.size(); i++){
  			for(int j = 0; j < s2.size(); j++){
  				int x = s1.get(i);
  				int y = s2.get(j);
  
  				ch[x][y] = '+';
  				ch[y][x] = '-';
  			}
  		}
  
  		for(int i = 0; i < s2.size(); i++){
  			int wincount = 0;
  			for(int j = i; j < s2.size(); j++){
  				int x = s2.get(i);
  				int y = s2.get(j);
  
  				if(x == y) ch[x][y] = 'X';
  				else{
  					if(wincount == 0) {
  						ch[x][y] = '+';
  						ch[y][x] = '-';
  						wincount++;
  					}
  					else{
  						ch[x][y] = '-';
  						ch[y][x] = '+';
  					}
  				}
  			}
  		}
  
  		for(int i = 0; i < n; i++){
  			if(ch1[i] == '1'){
  				for(char c : ch[i]){
  					if(c == '-'){
  						print(1, "NO");
  						return;
  					}
  				}
  			}
  			else{
  				int wc = 0;
  				for(char c : ch[i]){
  					if(c == '+'){
  						wc++;
  					}
  				}
  				if(wc == 0){
  						print(1, "NO");
  						return;
  				}
  			}
  		}
  
  		print(1, "YES");
  		for(char[] x : ch){
  			print(1, String.valueOf(x));
  		}
  	}
  
  	public static void main(String[] args) throws Exception {
  		int t = pi(in.readLine());
  		while(t-- > 0){
  			go();
  		}
  		in.close();
  	}
  
  	static long mul(long a, long b) {
  		return ((a % mod) * (b % mod)) % mod;
  	}
  
  	static class FastReader {
  		final private int BUFFER_SIZE = 1 << 16;
  		private DataInputStream din;
  		private byte[] buffer;
  		private int bufferPointer, bytesRead;
  
  		public FastReader() {
  			din = new DataInputStream(System.in);
  			buffer = new byte[BUFFER_SIZE];
  			bufferPointer = bytesRead = 0;
  		}
  
  		public FastReader(String file_name) throws IOException {
  			din = new DataInputStream(new FileInputStream(file_name));
  			buffer = new byte[BUFFER_SIZE];
  			bufferPointer = bytesRead = 0;
  		}
  
  		public String readLine() throws IOException {
  			byte[] buf = new byte[64]; // line length
  			int cnt = 0, c;
  			while ((c = read()) != -1) {
  				if (c == '\n') {
  					if (cnt != 0) {
  						break;
  					} else {
  						continue;
  					}
  				}
  				buf[cnt++] = (byte) c;
  			}
  			return new String(buf, 0, cnt);
  		}
  
  		public int ni() throws IOException {
  			int ret = 0;
  			byte c = read();
  			while (c <= ' ') {
  				c = read();
  			}
  			boolean neg = (c == '-');
  			if (neg)
  				c = read();
  			do {
  				ret = ret * 10 + c - '0';
  			} while ((c = read()) >= '0' && c <= '9');
  
  			if (neg)
  				return -ret;
  			return ret;
  		}
  
  		public long nl() throws IOException {
  			long ret = 0;
  			byte c = read();
  			while (c <= ' ')
  				c = read();
  			boolean neg = (c == '-');
  			if (neg)
  				c = read();
  			do {
  				ret = ret * 10 + c - '0';
  			} while ((c = read()) >= '0' && c <= '9');
  			if (neg)
  				return -ret;
  			return ret;
  		}
  
  		public double nd() throws IOException {
  			double ret = 0, div = 1;
  			byte c = read();
  			while (c <= ' ')
  				c = read();
  			boolean neg = (c == '-');
  			if (neg)
  				c = read();
  
  			do {
  				ret = ret * 10 + c - '0';
  			} while ((c = read()) >= '0' && c <= '9');
  
  			if (c == '.') {
  				while ((c = read()) >= '0' && c <= '9') {
  					ret += (c - '0') / (div *= 10);
  				}
  			}
  
  			if (neg)
  				return -ret;
  			return ret;
  		}
  
  		private void fillBuffer() throws IOException {
  			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
  			if (bytesRead == -1)
  				buffer[0] = -1;
  		}
  
  		private byte read() throws IOException {
  			if (bufferPointer == bytesRead)
  				fillBuffer();
  			return buffer[bufferPointer++];
  		}
  
  		public void close() throws IOException {
  			if (din == null)
  				return;
  			din.close();
  		}
  	}
  
  	static String rl() throws Exception{
  		return in.readLine();
  	}
  
  	static int pi(String s) {
  		return Integer.parseInt(s);
  	}
  
  	static long pl(String s) {
  		return Long.parseLong(s);
  	}
  
  	static void print(int newline, String s) {
  		System.out.print(s);
  		if (newline != 0)
  			System.out.println();
  		// System.out.flush();
  	}
  
  	static void cprint(int x) {
  		print(0, "Case #" + x + ": ");
  	}
  
  	//utility function for gcd
  	private static long gcd(long a, long b)
  	{
  		if(a == 0 || b == 0)return a + b;
  		if(a > b)return gcd(a % b, b);
  		return gcd(a, b % a);
  	}
  
  	// construct sparse table : for static range queries
  	static class SparseTable{
  		static long[][] precompute(long[] arr)
  		{
  			int n = arr.length;
  			int p = (int)((double)Math.log(n) / Math.log(2));
  			long[][] f = new long[p+1][n];
  
  			for(int i = 0; i < n; i++) f[0][i] = arr[i];
  			for(int j = 1; j <= p; j++){
  				for(int i = 0; i + (1 << j) - 1 < n; i++){
  					f[j][i] = gcd(f[j-1][i], f[j-1][i + (1 << (j-1))]);
  				}
  			}
  			return f;
  		}
  	}
  
  	//Union Rank Algorithm
  	static class UnionFind {
  		int[] parent = null;
  		int[] rank = null;
  
  		UnionFind(int n){
  			parent = new int[n];
  			rank = new int[n];
  			for(int i = 0; i < n; i++) parent[i] = i;
  		}
  
  		int find(int v){
  			if(parent[v] != v) parent[v] = find(parent[v]);
  			return parent[v];
  		}
  
  		boolean union(int x, int y) {
  			int u = find(x);
  			int v = find(y);
  
  			//both belong to same set...
  			if(u == v)return false;
  
  			if(rank[u] > rank[v])
  				parent[v] = u;
  			else if(rank[u] < rank[v])
  				parent[u] = v;
  			else{
  				parent[u] = v;
  				rank[v]++;
  			}
  			return true;
  		}
  	}
  
  	//Fenwick Tree Implementation
  	static class BIT{
  		int bit[] = null;
  
  		BIT(int n){
  			bit = new int[n+1];
  		}
  
  		private void update(int x){
  			int index = x;
  			while(index < bit.length){
  				bit[index]+=1;
  				index += (index & -index);
  			}
  		}
  
  		private int sum(int l){
  			int index = l-1;
  			int c = 0;
  			while(index > 0){
  				c+=bit[index];
  				index -= (index & -index);
  			}
  			return c;
  		}
  	}
  
  	//Suffix Array Impl
  	static class SuffixArray{
  
  		// suffix array in O(n*log^2(n))
  		public static Integer[] suffixArray(CharSequence s) {
  			int n = s.length();
  			Integer[] sa = new Integer[n];
  			int[] rank = new int[n];
  			for (int i = 0; i < n; i++) {
  				sa[i] = i;
  				rank[i] = s.charAt(i);
  			}
  			for (int len = 1; len < n; len *= 2) {
  				long[] rank2 = new long[n];
  				for (int i = 0; i < n; i++)
  					rank2[i] = ((long) rank[i] << 32) + (i + len < n ? rank[i + len] + 1 : 0);
  
  				Arrays.sort(sa, (a, b) -> Long.compare(rank2[a], rank2[b]));
  
  				for (int i = 0; i < n; i++)
  					rank[sa[i]] = i > 0 && rank2[sa[i - 1]] == rank2[sa[i]] ? rank[sa[i - 1]] : i;
  			}
  			return sa;
  		}
  	}
  
  }