Interactive RBS (Easy Version)

The statement is originally interactive, but the version you submit to Codeforces hacks is offline. That distinction is the whole problem here. If you miss it, you end up writing an interactive solution that prints ? queries and then gets obliterated because there is no interactor listening.

For hacks, the input format is explicitly changed:

• first comes $t$;
• for each test case, we get $n$;
• then we get the bracket sequence $s$ itself.

So the hidden sequence is no longer hidden. The problem asks us to find $s$, and the input already gives us $s$. That sounds stupid because, for the hacked format, it kind of is. Interactive-to-offline conversions often have this awkward shape.

Algorithm

For each test case:

1. Read $n$.
2. Read the string $s$.
3. Print $s$.

That is it. Seriously. The clever part is not overengineering the original interactive protocol into an offline judge that cannot answer queries.

Correctness Proof

For each test case, the hacked input contains the exact bracket sequence $s_1s_2\ldots s_n$.

The algorithm reads this exact string and outputs it unchanged. Therefore, the output sequence is identical to the hidden sequence required by the original problem.

Thus, for every test case, the algorithm outputs the correct bracket sequence. $\square$

Complexity

For each test case, reading and printing the string takes $O(n)$ time and $O(n)$ memory. Since $n \le 1000$, this is miles under the limits.