CF1574A.Regular Bracket Sequences

A bracket sequence is a string containing only characters "(" and ")". A regular bracket sequence is a bracket sequence that can be transformed into a correct arithmetic expression by inserting characters "1" and "+" between the original characters of the sequence. For example, bracket sequences "()()" and "(())" are regular (the resulting expressions are: "(1)+(1)" and "((1+1)+1)"), and ")(", "(" and ")" are not.

You are given an integer $n$. Your goal is to construct and print exactly $n$ different regular bracket sequences of length $2n$.

括号序列是指仅由字符 ( 和 ) 组成的字符串。正则括号序列（regular bracket sequence）是一种括号序列，它可以通过在原序列的字符之间插入字符 1 和 +，从而转化为一个合法的算术表达式。例如，括号序列 "()()" 和 "(())" 是正则的（对应的表达式分别为 "(1)+(1)" 和 "((1+1)+1)"），而 ")(", "(" 和 ")" 则不是。

给你一个整数 $n$。你的目标是构造并输出恰好 $n$ 个互不相同的长度为 $2n$ 的正则括号序列。

The first line contains one integer $t$ ($1 \le t \le 50$) — the number of test cases.

Each test case consists of one line containing one integer $n$ ($1 \le n \le 50$).

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

每个测试用例由一行组成，该行包含一个整数 $n$（$1 \le n \le 50$）。

For each test case, print $n$ lines, each containing a regular bracket sequence of length exactly $2n$. All bracket sequences you output for a testcase should be different (though they may repeat in different test cases). If there are multiple answers, print any of them. It can be shown that it's always possible.

对于每个测试用例，输出 $n$ 行，每行包含一个长度恰好为 $2n$ 的合法括号序列。你在该测试用例中输出的所有括号序列必须互不相同（但在不同测试用例之间可以重复）。若存在多种答案，输出任意一种即可。可以证明，这样的答案总是存在的。