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
import java.util.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;


public class practiceb{

    static FastScanner sc;
    static TreeSet<Integer> ans;
    static long[] arr,arr1,dp;
    static char[][] board;
    static long mul,mul1;
    static int[] spf;
    static char[] ch;
    static int n,q,m;
    static long k,a,x,c;
    static StringBuilder sb,sb1;
    static long b,sum;
    static Map<Integer,List<Integer>> map;
    static Map<Long,List<Integer>> map2;
    static Map<Long,List<Integer>> map3;
    static Map<Integer,Integer> shortest;
    static Map<Integer,List<Integer>> map1;
    static List<Long> list,list1;
    static int[] count;

    // static class Node{
    //     long dist;
    //     Set<Integer> set;
    //     Node(){
    //         this.set = new HashSet<>();
    //     }
    //     Node(int f){
    //         this.dist = f;
    //         this.set = new HashSet<>();
    //     }
    // }

    // public static class Lca {

    //     int[] depth;
    //     int[] dfs_order;
    //     int cnt;
    //     int[] first;
    //     int[] minPos;
    //     int n;

    //     void dfs(List<Integer>[] tree, int u, int d) {
    //         depth[u] = d;
    //         dfs_order[cnt++] = u;
    //         for (int v : tree[u])
    //             if (depth[v] == -1) {
    //                 dfs(tree, v, d + 1);
    //                 dfs_order[cnt++] = u;
    //             }
    //     }

    //     void buildTree(int node, int left, int right) {
    //         if (left == right) {
    //             minPos[node] = dfs_order[left];
    //             return;
    //         }
    //         int mid = (left + right) >> 1;
    //         buildTree(2 * node + 1, left, mid);
    //         buildTree(2 * node + 2, mid + 1, right);
    //         minPos[node] = depth[minPos[2 * node + 1]] < depth[minPos[2 * node + 2]] ? minPos[2 * node + 1] : minPos[2 * node + 2];
    //     }

    //     public Lca(List<Integer>[] tree, int root) {
    //         int nodes = tree.length;
    //         depth = new int[nodes];
    //         Arrays.fill(depth, -1);

    //         n = 2 * nodes - 1;
    //         dfs_order = new int[n];
    //         cnt = 0;
    //         dfs(tree, root, 0);

    //         minPos = new int[4 * n];
    //         buildTree(0, 0, n - 1);

    //         first = new int[nodes];
    //         Arrays.fill(first, -1);
    //         for (int i = 0; i < dfs_order.length; i++)
    //             if (first[dfs_order[i]] == -1)
    //                 first[dfs_order[i]] = i;
    //     }

    //     public int lca(int a, int b) {
    //         return minPos(Math.min(first[a], first[b]), Math.max(first[a], first[b]), 0, 0, n - 1);
    //     }

    //     int minPos(int a, int b, int node, int left, int right) {
    //         if (a == left && right == b)
    //             return minPos[node];
    //         int mid = (left + right) >> 1;
    //         if (a <= mid && b > mid) {
    //             int p1 = minPos(a, Math.min(b, mid), 2 * node + 1, left, mid);
    //             int p2 = minPos(Math.max(a, mid + 1), b, 2 * node + 2, mid + 1, right);
    //             return depth[p1] < depth[p2] ? p1 : p2;
    //         } else if (a <= mid) {
    //             return minPos(a, Math.min(b, mid), 2 * node + 1, left, mid);
    //         } else if (b > mid) {
    //             return minPos(Math.max(a, mid + 1), b, 2 * node + 2, mid + 1, right);
    //         } else {
    //             throw new RuntimeException();
    //         }
    //     }
    // }

    // private static long dfs(int v, int parent,long ht) {

    //     List<Integer> list = map.get(v);
    //     hyt[v] = ht;

    //     if(list.size() == 1){
    //         if(!map3.containsKey(ht))
    //             map3.put(ht,new ArrayList<>());

    //         map3.get(ht).add(v);
    //         return ht;

    //     }

    //     long maxl = -1;
    //     for(Integer i : list){
    //         if(i == parent)
    //             continue;
    //         maxl = Math.max(maxl,dfs(i,v,ht+1));
    //     }

    //     return maxl;

    // }
    // public static int N = 100005;

    // long a[N];
    // long sfx[N];
    // long pfx[N];

//    public static boolean f(int width){
//
//        // long[] a = new long[n];
//        long[] sfx = new long[n];
//        long[] pfx = new long[n];

//        for (int j = 0; j < n; j++){
//            if (j % width == 0){
//                pfx[j] = a[j];
//            }
//            else pfx[j] = gcd(pfx[j - 1], a[j]);
//        }
//        for (int j = n - 2; j >= 0; j--){
//            if (j % width == width - 1){
//                sfx[j] = a[j];
//            }
//            else sfx[j] = gcd(sfx[j + 1], a[j]);
//        }
//
//        for(int j = 0; j < n - width + 1 ; j++){
//            if (gcd(sfx[j], pfx[j + width - 1]) >= k) return true;
//            if (((j % width) == width - 1) && pfx[j] >= k){
//                return true;
//            }
//        }
//        return false;
//    }

    public static void solve() {

        int twos = 0;
        char[][] mat = new char[n][n];

        for(int i = 0 ; i < n ; i++)
            Arrays.fill(mat[i],'#');

        for(int i = 0 ; i < n ; i++)
            if(ch[i] == '2')
                twos += 1;

        if(twos == 1 || twos == 2) {
            sb.append("NO\n");
            return;
        }
        else {
            for(int i = 0 ; i < n ; i++) {
                if(ch[i] == '1') {
                    for(int j = 0 ; j < n ; j++) {
                        if(i == j)
                            mat[i][j] = 'X';
                        else {
                            mat[i][j] = '=';
                            mat[j][i] = '=';
                        }
                    }
                }
            }
        }

        for(int i = 0 ; i < n ; i++) {
            if(ch[i] == '2') {
                mat[i][i] = 'X';
                boolean flag = false;
                for(int j = i+1 ; j < n ; j++) {
                    if(mat[i][j] != '#')
                        continue;
                    else {

                        if(!flag) {
                            mat[i][j] = '+';
                            mat[j][i] = '-';
                            flag = true;
                            continue;
                        }

                        mat[i][j] = '-';
                        mat[j][i] = '+';
                    }
                }
            }
        }

        sb.append("YES\n");
        for(int i = 0 ; i < n ; i++) {
            for(int j = 0 ; j < n ; j++) {
                sb.append(mat[i][j]);
            }
            sb.append("\n");
        }

    }

    public static void main(String[] args) {

        sc = new FastScanner();
        // Scanner sc = new Scanner(System.in);
        // SpecialSieve(5000000+5);
//        long num = 1;
//        list = new ArrayList<>();
//        for(int i = 0 ; i <= 60 ; i++) {
//            list.add(num);
//            num *= 2;
//        }
        int t = sc.nextInt();
         sb = new StringBuilder();
//         int t = 1;
        while(t > 0){

//            a = sc.nextLong();
//            b = sc.nextLong();
//            c = sc.nextLong();
            n = sc.nextInt();
            // x = sc.nextLong();
//             m = sc.nextInt();
//             k = sc.nextInt();
            // mat = new int[2][m];

            // for(int i = 0 ; i < 2 ; i++)
            //     for(int j = 0 ; j < m ; j++)
            //         mat[i][j] = sc.nextLong();

            // for(int i = 1 ; i <= 15 ; i++){
            //     m = i;
            //     solve();
            // // }
            // board = new char[3][3];
            // for(int i = 0 ; i < 3 ; i++){
            //     String s = sc.next();
            //     for(int j = 0 ; j < 3 ; j++){
            //         board[i][j] = s.charAt(j);
            //     }
            // }
            // x = sc.nextInt();
             ch = sc.next().toCharArray();
            // q = sc.nextInt();
//             ch = sc.next().toCharArray();
//            arr = new long[n];
//            for(int i = 0 ; i < n ; i++)
//                arr[i] = sc.nextLong();
//
//            arr1 = new long[m];
//            for(int i = 0 ; i < m ; i++)
//                arr1[i] = sc.nextLong();
//
//            a = new long[n-1];
//            for(int i = 1 ; i < n ; i++)
//                a[i-1] = Math.abs(arr[i] - arr[i-1]);
//
//            n -= 1;

            solve();
            t -= 1;
        }
         System.out.print(sb);

    }

    // Use this instead of Arrays.sort() on an array of ints. Arrays.sort() is n^2
    // worst case since it uses a version of quicksort. Although this would never
    // actually show up in the real world, in codeforces, people can hack, so
    // this is needed.
    static void ruffleSort(long[] a) {
        //ruffle
        int n=a.length;
        Random r=new Random();
        for (int i=0; i<a.length; i++) {
            int oi=r.nextInt(n);long temp=a[i];
            a[i]=a[oi];
            a[oi]=temp;
        }

        //then sort
        Arrays.sort(a);
    }
    public static long gcd(long a, long b)
    {
        if (b == 0)
            return a;

        return gcd(b, a % b);

    }
    public static int log(double n,double base){

        if(n == 0 || n == 1)
            return 0;

        if(n == base)
            return 1;

        double num = Math.log(n);
        double den = Math.log(base);

        if(den == 0)
            return 0;

        return (int)(num/den);
    }
    public static long mod(long x, long mod)
    {
        long result = x % mod;
        if (result < 0)
        {
            result += mod;
        }
        return result;
    }

    // Use this to input code since it is faster than a Scanner
    static class FastScanner {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer("");
        String next() {
            while (!st.hasMoreTokens())
                try {
                    st=new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }
        int[] readArray(int n) {
            int[] a=new int[n];
            for (int i=0; i<n; i++) a[i]=nextInt();
            return a;
        }
        long nextLong() {
            return Long.parseLong(next());
        }
    }
}
