description: 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.
  
  Input
  
  The first line contains one integer t (1 ≤ t ≤ 50) — the number of test cases.
  
  Each test case consists of one line containing one integer n (1 ≤ n ≤ 50).
  
  Output
  
  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.
  
  Example
  
  Input
  
  
  3
  3
  1
  3
  
  
  Output
  
  
  ()()()
  ((()))
  (()())
  ()
  ((()))
  (())()
  ()(())
solution: import java.io.*;
  import java.util.*;
  
  /**
   * Made by egor https://github.com/chermehdi/egor.
   *
   * @author Azuz 
   *
   */
  public class Main {
    void solve(int testNumber, InputReader in, PrintWriter out) {
      int n = in.nextInt();
      for (int i = 0; i < n; ++i) {
        for (int j = 0; j <= i; ++j) {
          out.print('(');
        }
        for (int j = 0; j <= i; ++j) {
          out.print(')');
        }
        for (int j = i + 1; j < n; ++j) {
          out.print("()");
        } out.println();
      }
    }
  
    void solve(InputReader in, PrintWriter out) {
      int current = 0;
      int tests = in.nextInt();
      while (current < tests) {
        solve(++current, in, out);
      }
    }
  
    public static void main(String[] args) {
      InputReader in = new InputReader(System.in);
      try (PrintWriter out = new PrintWriter(System.out)) {
        new Main().solve(in, out);
      }
    }
  }
  
  class InputReader  {
  
    private InputStream stream;
    private static final int DEFAULT_BUFFER_SIZE = 1 << 16;
    private static final int EOF = -1;
    private byte[] buf = new byte[DEFAULT_BUFFER_SIZE];
    private int curChar;
    private int numChars;
  
    public InputReader(InputStream stream) {
      this.stream = stream;
    }
  
    public int[] readIntArray(int tokens) {
      int[] ret = new int[tokens];
      for (int i = 0; i < tokens; i++) {
        ret[i] = nextInt();
      }
      return ret;
    }
  
    public int read() {
      if (this.numChars == EOF) {
        throw new UnknownError();
      } else {
        if (this.curChar >= this.numChars) {
          this.curChar = 0;
  
          try {
            this.numChars = this.stream.read(this.buf);
          } catch (IOException ex) {
            throw new InputMismatchException();
          }
  
          if (this.numChars <= 0) {
            return EOF;
          }
        }
  
        return this.buf[this.curChar++];
      }
    }
  
    public int nextInt() {
      int c;
      for (c = this.read(); isSpaceChar(c); c = this.read()) {
      }
  
      byte sgn = 1;
      if (c == 45) {
        sgn = -1;
        c = this.read();
      }
  
      int res = 0;
  
      while (c >= 48 && c <= 57) {
        res *= 10;
        res += c - 48;
        c = this.read();
        if (isSpaceChar(c)) {
          return res * sgn;
        }
      }
  
      throw new InputMismatchException();
    }
  
    public long nextLong() {
      int c;
      for (c = this.read(); isSpaceChar(c); c = this.read()) {
      }
  
      byte sgn = 1;
      if (c == 45) {
        sgn = -1;
        c = this.read();
      }
  
      long res = 0;
  
      while (c >= 48 && c <= 57) {
        res *= 10L;
        res += c - 48;
        c = this.read();
        if (isSpaceChar(c)) {
          return res * sgn;
        }
      }
      throw new InputMismatchException();
    }
  
    public double nextDouble() {
      double ret = 0, div = 1;
      int c = read();
      while (c <= ' ') {
        c = read();
      }
      boolean neg = (c == '-');
      if (neg) {
        c = read();
      }
  
      do {
        ret = ret * 10 + c - '0';
      }
      while ((c = read()) >= '0' && c <= '9');
  
      if (c == '.') {
        while ((c = read()) >= '0' && c <= '9') {
          ret += (c - '0') / (div *= 10);
        }
      }
  
      if (neg) {
        return -ret;
      }
      return ret;
    }
  
    public String next() {
      int c;
      while (isSpaceChar(c = this.read())) {
      }
  
      StringBuilder result = new StringBuilder();
      result.appendCodePoint(c);
  
      while (!isSpaceChar(c = this.read())) {
        result.appendCodePoint(c);
      }
  
      return result.toString();
    }
  
    public String nextLine() {
      int c;
      StringBuilder result = new StringBuilder();
      boolean read = false;
      while ((c = this.read()) != '\n') {
        if (c == -1) {
          return null;
        }
        result.appendCodePoint(c);
        read = true;
      }
      if (!read) {
        return null;
      }
      return result.toString();
    }
  
    public static boolean isSpaceChar(int c) {
      return c == 32 || c == 10 || c == 13 || c == 9 || c == EOF;
    }
  
    public int[] nextIntArray(int n) {
      int[] arr = new int[n];
      for (int i = 0; i < n; i++) {
        arr[i] = nextInt();
      }
      return arr;
    }
  
    public long[] nextLongArray(int n) {
      long[] arr = new long[n];
      for (int i = 0; i < n; i++) {
        arr[i] = nextLong();
      }
      return arr;
    }
  
    public int[][] nextIntMatrix(int n, int m) {
      int[][] arr = new int[n][m];
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
          arr[i][j] = nextInt();
        }
      }
      return arr;
    }
  
    public long[][] nextLongMatrix(int n, int m) {
      long[][] arr = new long[n][m];
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
          arr[i][j] = nextLong();
        }
      }
      return arr;
    }
  
    public char[] nextCharArray() {
      return next().toCharArray();
    }
  
    public double[] nextDoubleArray(int n) {
      double[] ret = new double[n];
      for (int i = 0; i < n; i++) {
        ret[i] = nextDouble();
      }
      return ret;
    }
  
    public int[]
    nextIntArrayOneBased(int n) {
      int[] ret = new int[n + 1];
      for (int i = 1; i <= n; i++) {
        ret[i] = nextInt();
      }
      return ret;
    }
  
    public char[][] nextCharMatrix(int n, int m) {
      char[][] res = new char[n][m];
      for (int i = 0; i < n; ++i) {
        res[i] = nextCharArray();
      }
      return res;
    }
  }
  