AT_scpc2026_div1_c.SCSC Magical Garden

Haru_101 prepared an $N \times N$ grid-shaped garden for SCSC. Every spring, SCSC members have a beautiful tradition of planting one flower in each cell. This year, they decided to plant sunflowers and clovers.

After all flowers were planted, Terra and Lulu looked around the garden and gave different impressions.

Terra looked down at the whole garden from a high place and said: "Looking at the whole garden, there are more cells planted with blue clovers than yellow sunflowers!"

Lulu likes taking photos, so Lulu walked around the garden and took photos of size $3 \times 3$. After taking photos of every $3 \times 3$ area in the garden without omission, Lulu looked at the photos and said: "Huh? In every photo I took, there are more sunflowers than clovers!"

Can you make a magical garden where, as Terra said, the whole garden has more clovers, but every photo Lulu took has more sunflowers?

Haru_101 为 SCSC 准备了一个 $N \times N$ 的网格状花园。每年春天，SCSC 成员都有一个优美的传统：在每个格子中种植一朵花。今年，他们决定种植向日葵和三叶草。

所有花朵种完后，Terra 和 Lulu 在花园中四处观察，并给出了不同的印象。

Terra 从高处俯瞰整个花园，说道：“从整体上看，种有蓝色三叶草的格子数比种有黄色向日葵的格子数更多！”

Lulu 喜欢拍照，因此她绕着花园走了一圈，拍摄了所有大小为 $3 \times 3$ 的区域的照片（不遗漏任何一处）。拍完所有 $3 \times 3$ 区域的照片后，Lulu 查看照片并说道：“咦？我拍的每一张照片中，向日葵的数量都比三叶草多！”

你能否构造一个“神奇的花园”，使得：正如 Terra 所说，整个花园中三叶草总数多于向日葵；但同时，Lulu 拍摄的每一张 $3 \times 3$ 照片中，向日葵数量都多于三叶草？

The input is given from Standard Input in the following format:

$T$
$\mathrm{case}_1$
$\mathrm{case}_2$
$\vdots$
$\mathrm{case}_T$

Each test case is given in the following format:

$N$

输入从标准输入给出，格式如下：

$T$
$\mathrm{case}_1$
$\mathrm{case}_2$
$\vdots$
$\mathrm{case}_T$

每个测试用例的格式如下：

$N$

For each test case, output the answer in the following format.

If it is possible to make a magical garden, output YES on the first line.

Then output $N$ lines, each containing a string of length $N$ representing the state of the garden. Each string must consist only of S and C. The $j$-th character of the $i$-th string must be S if the flower planted in cell $(i,j)$ of the garden is a sunflower, and C if it is a clover. In every $3 \times 3$ subgrid of the grid, the number of S must be greater than the number of C, and in the whole grid, the number of C must be greater than the number of S.

If there are multiple magical gardens, output any one of them.

If it is impossible to make a magical garden, output NO on a single line instead.

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

如果能够构造出一个魔法花园，则在第一行输出 YES。

随后输出 $N$ 行，每行是一个长度为 $N$ 的字符串，表示花园的状态。每个字符串仅由字符 S 和 C 组成。第 $i$ 行的第 $j$ 个字符应为 S，当且仅当花园中位置 $(i,j)$ 处种植的是向日葵；应为 C，当且仅当该位置种植的是三叶草。在网格的每一个 $3 \times 3$ 子网格中，S 的数量必须严格大于 C 的数量；而在整个 $N \times N$ 网格中，C 的数量必须严格大于 S 的数量。

若存在多个满足条件的魔法花园，输出任意一个即可。

若无法构造出魔法花园，则单独一行输出 NO。

表示言語

/ /

Constraints

• $1 \leq T \leq 1\,000$
• For each test case, $3 \leq N \leq 1\,000$.
• All given numbers are integers.
• Only cases where the output does not exceed $2$ MiB are given.

表示语言

/ /

限制条件

• $1 \leq T \leq 1\,000$
• 对于每个测试用例，$3 \leq N \leq 1\,000$。
• 所有给定的数均为整数。
• 输入数据仅包含输出大小不超过 $2$ MiB 的情况。