CF1569B.Chess Tournament

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.

一场国际象棋锦标赛即将举行，共有 $n$ 名棋手参赛。每名选手都将与其他所有选手各进行一场比赛。每场比赛的结果要么是一方获胜、另一方失利，要么是双方战成平局。

每位选手对本次锦标赛都有自己的期望，期望类型只有以下两种之一：

1. 该选手希望不输掉任何一场比赛（即：以零场失利的成绩结束锦标赛）；
2. 该选手希望至少赢下一场比赛。

你需要判断：是否存在一种所有比赛结果的安排方式，使得所有选手均满足各自的期望？若存在多种可行方案，输出任意一种即可；若不存在，则报告“不可能”。

The first line contains a single integer $t$ ($1 \le t \le 200$) — the number of test cases.

The first line of each test case contains one integer $n$ ($2 \le n \le 50$) — the number of chess players.

The second line contains the string $s$ ($|s| = n$; $s_i \in {1, 2}$). If $s_i = 1$, then the $i$-th player has expectations of the first type, otherwise of the second type.

第一行包含一个整数 $t$（$1 \le t \le 200$）—— 测试用例的数量。

每个测试用例的第一行包含一个整数 $n$（$2 \le n \le 50$）—— 国际象棋选手的数量。

每个测试用例的第二行包含一个字符串 $s$（$|s| = n$；$s_i \in \{1, 2\}$）。若 $s_i = 1$，则第 $i$ 位选手具有第一类期望；否则具有第二类期望。

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 \times 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$.

对于每个测试用例，请按以下格式输出答案：

第一行，如果无法满足所有玩家的期望，则输出 NO。

否则，输出 YES，并在接下来的 $n$ 行中输出一个 $n \times n$ 的矩阵。

该矩阵第 $i$ 行第 $j$ 列的元素应为：

• +，表示第 $i$ 位玩家在与第 $j$ 位玩家的对局中获胜；
• -，表示第 $i$ 位玩家在与第 $j$ 位玩家的对局中失利；
• =，表示第 $i$ 位玩家与第 $j$ 位玩家的对局结果为平局；
• X，当 $i = j$ 时。