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: # DaRk DeveLopeR
  import sys
  
  # taking input as string
  input = lambda: sys.stdin.readline().rstrip("\r\n")
  inp = lambda: list(map(int, sys.stdin.readline().rstrip("\r\n").split()))
  mod = 10 ** 9 + 7;
  Mod = 998244353;
  INF = float('inf')
  # ______________________________________________________________________________________________________
  import math
  from bisect import *
  from heapq import *
  from collections import defaultdict as dd
  from collections import OrderedDict as odict
  from collections import Counter as cc
  from collections import deque
  from itertools import groupby
  
  sys.setrecursionlimit(20 * 20 * 20 * 20 + 10)  # this is must for dfs
  
  
  def solve():
      n = takein()
  
      string = takesr()
  
      mat = [[""] * n for i in range(n)]
  
      if 1<=string.count("2")<=2:
          print("NO")
          return
  
      print("YES")
  
      for i in range(n):
          if string[i]=="2":
              ans=True
              for j in range(n):
  
                  if i!=j and mat[i][j]=="+":
                      ans=False
                      break
          for j in range(n):
  
              if i == j:
                  # print("y")
                  mat[i][j] = "X"
  
              elif string[i] == "1" or string[j] == "1":
                  # print("2")
                  mat[i][j] = "="
  
              elif mat[i][j] == "":
                  if ans:
                      ans=False
                      mat[i][j] = "+"
                      mat[j][i] = "-"
                  else:
                      mat[i][j] = "-"
                      mat[j][i] = "+"
  
  
  
      for i in range(n):
  
          for j in range(n):
              print(mat[i][j], end="")
  
          print()
  
  
  def main():
      global tt
      if not ONLINE_JUDGE:
          sys.stdin = open("input.txt", "r")
          sys.stdout = open("output.txt", "w")
      t = 1
      t = takein()
      # t = 1
      for tt in range(1, t + 1):
          solve()
      if not ONLINE_JUDGE:
          print("Time Elapsed :", time.time() - start_time, "seconds")
          sys.stdout.close()
  
  
  # ---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#
  def takein():
      return (int(sys.stdin.readline().rstrip("\r\n")))
  
  
  # input the string
  
  def takesr():
      return (sys.stdin.readline().rstrip("\r\n"))
  
  
  # input int array
  def takeiar():
      return (list(map(int, sys.stdin.readline().rstrip("\r\n").split())))
  
  
  # input string array
  def takesar():
      return (list(map(str, sys.stdin.readline().rstrip("\r\n").split())))
  
  
  # innut values for the diffrent variables
  def takeivr():
      return (map(int, sys.stdin.readline().rstrip("\r\n").split()))
  
  
  def takesvr():
      return (map(str, sys.stdin.readline().rstrip("\r\n").split()))
  
  
  # ------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
  
  
  def ispalindrome(s):
      return s == s[::-1]
  
  
  def invert(bit_s):
      # convert binary string
      # into integer
      temp = int(bit_s, 2)
  
      # applying Ex-or operator
      # b/w 10 and 31
      inverse_s = temp ^ (2 ** (len(bit_s) + 1) - 1)
  
      # convert the integer result
      # into binary result and then
      # slicing of the '0b1'
      # binary indicator
      rslt = bin(inverse_s)[3:]
  
      return str(rslt)
  
  
  def counter(a):
      q = [0] * max(a)
      for i in range(len(a)):
          q[a[i] - 1] = q[a[i] - 1] + 1
      return (q)
  
  
  def counter_elements(a):
      q = dict()
      for i in range(len(a)):
          if a[i] not in q:
              q[a[i]] = 0
          q[a[i]] = q[a[i]] + 1
      return (q)
  
  
  def string_counter(a):
      q = [0] * 26
      for i in range(len(a)):
          q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
      return (q)
  
  
  def factorial(n, m=1000000007):
      q = 1
      for i in range(n):
          q = (q * (i + 1)) % m
      return (q)
  
  
  def factors(n):
      q = []
      for i in range(1, int(n ** 0.5) + 1):
          if n % i == 0: q.append(i); q.append(n // i)
      return (list(sorted(list(set(q)))))
  
  
  def prime_factors(n):
      q = []
      while n % 2 == 0: q.append(2); n = n // 2
      for i in range(3, int(n ** 0.5) + 1, 2):
          while n % i == 0: q.append(i); n = n // i
      if n > 2: q.append(n)
      return (list(sorted(q)))
  
  
  def transpose(a):
      n, m = len(a), len(a[0])
      b = [[0] * n for i in range(m)]
      for i in range(m):
          for j in range(n):
              b[i][j] = a[j][i]
      return (b)
  
  
  def power_two(x):
      return (x and (not (x & (x - 1))))
  
  
  def ceil(a, b):
      return -(-a // b)
  
  
  def seive(n):
      a = [1]
      prime = [True for i in range(n + 1)]
      p = 2
      while (p * p <= n):
          if (prime[p] == True):
              for i in range(p ** 2, n + 1, p):
                  prime[i] = False
          p = p + 1
      for p in range(2, n + 1):
          if prime[p]:
              a.append(p)
      return (a)
  
  
  def pref(li):
      pref_sum = [0]
      for i in li:
          pref_sum.append(pref_sum[-1] + i)
      return pref_sum
  
  
  def kadane(x):  # maximum sum contiguous subarray
      sum_so_far = 0
      current_sum = 0
      for i in x:
          current_sum += i
          if current_sum < 0:
              current_sum = 0
          else:
              sum_so_far = max(sum_so_far, current_sum)
      return sum_so_far
  
  
  def binary_search(li, val):
      # print(lb, ub, li)
      ans = -1
      lb = 0
      ub = len(li) - 1
      while (lb <= ub):
          mid = (lb + ub) // 2
          # print('mid is',mid, li[mid])
          if li[mid] > val:
              ub = mid - 1
          elif val > li[mid]:
              lb = mid + 1
          else:
              ans = mid  # return index
              break
      return ans
  
  
  def upper_bound(li, num):
      answer = -1
      start = 0
      end = len(li) - 1
  
      while (start <= end):
          middle = (end + start) // 2
  
          if li[middle] <= num:
              answer = middle
              start = middle + 1
  
          else:
              end = middle - 1
      return answer  # max index where x is not greater than num
  
  
  def lower_bound(li, num):
      answer = -1
      start = 0
      end = len(li) - 1
  
      while (start <= end):
          middle = (end + start) // 2
          if li[middle] >= num:
              answer = middle
              end = middle - 1
          else:
              start = middle + 1
      return answer  # min index where x is not less than num
  
  
  # -----------------------------------------------------------------------#
  ONLINE_JUDGE = __debug__
  if ONLINE_JUDGE:
      input = sys.stdin.readline
  
  main()
  