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.util.*;
  import java.io.*;
  import java.math.*;
  import java.lang.*;
  
  public class a {
      
      static int mod = 1000000007;
  
      public static class Reader {
          final private int BUFFER_SIZE = 1 << 16;
          private DataInputStream din;
          private byte[] buffer;
          private int bufferPointer, bytesRead;
   
          public Reader()
          {
              din = new DataInputStream(System.in);
              buffer = new byte[BUFFER_SIZE];
              bufferPointer = bytesRead = 0;
          }
   
          public Reader(String file_name) throws IOException
          {
              din = new DataInputStream(
                  new FileInputStream(file_name));
              buffer = new byte[BUFFER_SIZE];
              bufferPointer = bytesRead = 0;
          }
   
          public String readLine() throws IOException
          {
              byte[] buf = new byte[64]; // line length
              int cnt = 0, c;
              while ((c = read()) != -1) {
                  if (c == '\n') {
                      if (cnt != 0) {
                          break;
                      }
                      else {
                          continue;
                      }
                  }
                  buf[cnt++] = (byte)c;
              }
              return new String(buf, 0, cnt);
          }
   
          public int nextInt() throws IOException
          {
              int ret = 0;
              byte 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 (neg)
                  return -ret;
              return ret;
          }
   
          public long nextLong() throws IOException
          {
              long ret = 0;
              byte 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 (neg)
                  return -ret;
              return ret;
          }
   
          public double nextDouble() throws IOException
          {
              double ret = 0, div = 1;
              byte 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;
          }
   
          private void fillBuffer() throws IOException
          {
              bytesRead = din.read(buffer, bufferPointer = 0,
                                   BUFFER_SIZE);
              if (bytesRead == -1)
                  buffer[0] = -1;
          }
   
          private byte read() throws IOException
          {
              if (bufferPointer == bytesRead)
                  fillBuffer();
              return buffer[bufferPointer++];
          }
   
          public void close() throws IOException
          {
              if (din == null)
                  return;
              din.close();
          }
      }
  
      public static void main(String[] args) throws Exception {
          Reader scn = new Reader();
          PrintWriter pw = new PrintWriter(System.out);
          int t = scn.nextInt();
          outer : while(t-->0){
              int n = scn.nextInt();
              for(int i=0; i<n; i++){
                  pw.print("(");
              }
              for(int i=0; i<n; i++){
                  pw.print(")");
              }
              pw.println();
              int count = 1;
              if(count == n){
                  continue outer;
              }
              for(int i=0; i<2*n; i++){
                  if(i % 2 == 0){
                      pw.print("(");
                  }else{
                      pw.print(")");
                  }
              }
              pw.println();
              count++;
              if(count == n){
                  continue outer;
              }
              for(int i=1; i<=n-2; i++){
                  for(int j=1; j<=i; j++){
                      pw.print("()");
                  }
                  int len = 2*n - 2*i;
                  for(int j=0; j<len/2; j++){
                      pw.print("(");
                  }
                  for(int j=0; j<len/2; j++){
                      pw.print(")");
                  }
                  pw.println();
              }
          }
          pw.close();
      }
  
      public static class Pair{
          long x;
          long y;
  
          Pair(long x, long y){
              this.x = x;
              this.y = y;
          }
      }
  
      private static void sort(int[] arr) {
          List<Integer> list = new ArrayList<>();
          for (int i=0; i<arr.length; i++){
              list.add(arr[i]);
          }
          Collections.sort(list); // collections.sort uses nlogn in backend
          for (int i = 0; i < arr.length; i++){
              arr[i] = list.get(i);
          }
      }
  
      private static void sort(long[] arr) {
          List<Long> list = new ArrayList<>();
          for(int i=0; i<arr.length; i++){
              list.add(arr[i]);
          }
          Collections.sort(list); // collections.sort uses nlogn in backend
          for (int i = 0; i < arr.length; i++){
              arr[i] = list.get(i);
          }
      }
  
      private static int lowerBound(int[] arr, int x){
          int n = arr.length, si = 0, ei = n - 1;
          while(si <= ei){
              int mid = si + (ei - si)/2;
              if(arr[mid] == x){
                  if(mid-1 >= 0 && arr[mid-1] == arr[mid]){
                      ei = mid-1;
                  }else{
                      return mid;
                  }
              }else if(arr[mid] > x){
                  ei = mid - 1; 
              }else{
                  si = mid+1;
              }
          }
          return si; 
      }
  
      private static int upperBound(int[] arr, int x){
          int n = arr.length, si = 0, ei = n - 1;
          while(si <= ei){
              int mid = si + (ei - si)/2;
              if(arr[mid] == x){
                  if(mid+1 < n && arr[mid+1] == arr[mid]){
                      si = mid+1;
                  }else{
                      return mid + 1;
                  }
              }else if(arr[mid] > x){
                  ei = mid - 1; 
              }else{
                  si = mid+1;
              }
          }
          return si; 
      }
  
      private static int upperBound(ArrayList<Integer> list, int x){
          int n = list.size(), si = 0, ei = n - 1;
          while(si <= ei){
              int mid = si + (ei - si)/2;
              if(list.get(mid) == x){
                  if(mid+1 < n && list.get(mid+1) == list.get(mid)){
                      si = mid+1;
                  }else{
                      return mid + 1;
                  }
              }else if(list.get(mid) > x){
                  ei = mid - 1; 
              }else{
                  si = mid+1;
              }
          }
          return si; 
      }
  
      // (x^y)%p in O(logy)
      private static long power(long x, long y){
          long res = 1; 
          x = x % mod;
          while(y > 0){
              if ((y & 1) == 1){
                  res = (res * x) % mod;
              }
              y = y >> 1; 
              x = (x * x) % mod;
          }
          return res;
      }
  
      public static boolean nextPermutation(int[] arr) {
          if(arr == null || arr.length <= 1){
              return false;
          }
          
          int last = arr.length-2;
          while(last >= 0){
              if(arr[last] < arr[last+1]){
                  break;
              }
              last--;
          }
  
          if (last < 0){
                return false;
          }
          
          if(last >= 0){
              int nextGreater = arr.length-1;
              for(int i=arr.length-1; i>last; i--){
                  if(arr[i] > arr[last]){
                      nextGreater = i;
                      break;
                  }
              }
              swap(arr, last, nextGreater);
          }
          
          reverse(arr, last+1, arr.length-1);
          return true;
      }
      
      private static void swap(int[] arr, int i, int j){
          int temp = arr[i];
          arr[i] = arr[j];
          arr[j] = temp;
      }
      
      private static void reverse(int[] arr, int i, int j){
          while(i < j){
              swap(arr, i++, j--);
          }
      }
  
      // TC- O(logmax(a,b))
      private static int gcd(int a, int b) {
          if(a == 0){
              return b;
          }
          return gcd(b%a, a);
      }
  
      private static long gcd(long a, long b) {
          if(a == 0L){
              return b;
          }
          return gcd(b%a, a);
      }
  
      private static long lcm(long a, long b) {
          return a / gcd(a, b) * b;
      }
  
      // TC- O(logmax(a,b))
      private static int lcm(int a, int b) {
          return a / gcd(a, b) * b;
      }
  
      private static long inv(long x){
          return power(x, mod - 2);
      }
  
      private static long summation(long n){
          return (n * (n + 1L)) >> 1;
      } 
  }