# Regular Bracket Sequences Solution Codeforces Educational Round 144

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 nn. Your goal is to construct and print exactly nn different regular bracket sequences of length 2n2n.

The first line contains one integer tt (1≤t≤501≤t≤50) — the number of test cases.

Each test case consists of one line containing one integer nn (1≤n≤501≤n≤50).

For each test case, print nn lines, each containing a regular bracket sequence of length exactly 2n2n. 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.

3 3 1 3

()()() ((())) (()()) () ((())) (())() ()(())