CF1107A.Digits Sequence Dividing

You are given a sequence $s$ consisting of $n$ digits from $1$ to $9$.

You have to divide it into at least two segments (segment — is a consecutive sequence of elements) (in other words, you have to place separators between some digits of the sequence) in such a way that each element belongs to exactly one segment and if the resulting division will be represented as an integer numbers sequence then each next element of this sequence will be strictly greater than the previous one.

More formally: if the resulting division of the sequence is $t_1, t_2, \dots, t_k$, where $k$ is the number of element in a division, then for each $i$ from $1$ to $k-1$ the condition $t_{i} \lt t_{i + 1}$ (using numerical comparing, it means that the integer representations of strings are compared) should be satisfied.

For example, if $s=654$ then you can divide it into parts $[6, 54]$ and it will be suitable division. But if you will divide it into parts $[65, 4]$ then it will be bad division because $65 \gt 4$. If $s=123$ then you can divide it into parts $[1, 23]$, $[1, 2, 3]$ but not into parts $[12, 3]$.

Your task is to find any suitable division for each of the $q$ independent queries.

给你一个由 $n$ 个数字（每个数字为 $1$ 到 $9$ 中的一个）组成的序列 $s$。

你需要将该序列划分为至少两个段（段是指元素的连续子序列）（换言之，你需要在序列的某些数字之间插入分隔符），使得每个元素恰好属于一个段；并且若将划分结果表示为一串整数，则该整数序列中每一个后续整数都严格大于前一个整数。

更形式化地：设划分结果为 $t_1, t_2, \dots, t_k$，其中 $k$ 是划分所得段的数量，则对每个从 $1$ 到 $k-1$ 的 $i$，都需满足条件 $t_{i} \lt t_{i + 1}$（此处为数值比较，即按字符串所表示的整数值进行比较）。

例如，若 $s=654$，则可将其划分为 $[6, 54]$，这是一个合法的划分。但若划分为 $[65, 4]$，则不合法，因为 $65 \gt 4$。若 $s=123$，则可划分为 $[1, 23]$ 或 $[1, 2, 3]$，但不能划分为 $[12, 3]$。

你的任务是对每个独立的 $q$ 个询问，找出任意一种合法的划分方案。

The first line of the input contains one integer $q$ ($1 \le q \le 300$) — the number of queries.

The first line of the $i$-th query contains one integer number $n_i$ ($2 \le n_i \le 300$) — the number of digits in the $i$-th query.

The second line of the $i$-th query contains one string $s_i$ of length $n_i$ consisting only of digits from $1$ to $9$.

输入的第一行包含一个整数 $q$（$1 \le q \le 300$），表示查询次数。

第 $i$ 次查询的第一行包含一个整数 $n_i$（$2 \le n_i \le 300$），表示第 $i$ 次查询中数字字符串的长度。

第 $i$ 次查询的第二行包含一个长度为 $n_i$ 的字符串 $s_i$，该字符串仅由数字 $1$ 到 $9$ 组成。

If the sequence of digits in the $i$-th query cannot be divided into at least two parts in a way described in the problem statement, print the single line "NO" for this query.

Otherwise in the first line of the answer to this query print "YES", on the second line print $k_i$ — the number of parts in your division of the $i$-th query sequence and in the third line print $k_i$ strings $t_{i, 1}, t_{i, 2}, \dots, t_{i, k_i}$ — your division. Parts should be printed in order of the initial string digits. It means that if you write the parts one after another without changing their order then you'll get the string $s_i$.

See examples for better understanding.

如果第 $i$ 个查询中的数字序列无法按照题目描述的方式划分为至少两个部分，则对该查询仅输出一行 "NO"。

否则，对该查询的答案：第一行输出 "YES"；第二行输出 $k_i$ —— 即你对第 $i$ 个查询序列所划分出的部分数量；第三行输出 $k_i$ 个字符串 $t_{i, 1}, t_{i, 2}, \dots, t_{i, k_i}$ —— 即你的划分结果。各部分应按原始字符串中数字的顺序输出。这意味着，若将这些部分按顺序拼接（不改变其相对顺序），则得到的字符串即为 $s_i$。

参见示例以加深理解。