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: 
  //package com.company;
  
  import java.util.*;
  import java.lang.*;
  import java.io.*;
  
  public final class Main {
  
      FastReader s;
  
      public static void main(String[] args) throws java.lang.Exception {
  
          new Main().run();
  
      }
  
      void run() {
          s = new FastReader();
          solve();
      }
  
      StringBuffer sb;
  
  
      void solve() {
  
          sb = new StringBuffer();
  
          for (int T = s.nextInt(); T > 0; T--) {
  
              start();
  
          }
  
          System.out.print(sb);
  
      }
         int c = 0;
      int y;
      void start()
      {
          c = 0;
  
            int n = s.nextInt();
            y = n;
           call("",n,n);
      }
  
      void call(String h ,int o, int cl )
      {
          if(c == y)return;
          if(cl == 0)
          {
              c++;
              sb.append(h+"\n");
              return;
          }
          if(y == c)return;
          if(cl>o)
          {
              call(h+")",o,cl-1);
          }
          else
          {
              for(int i = 0; i<o; i++)
              {
                  h+="(";
                  call(h,o-i-1,cl);
                  if(c == y)break;
              }
          }
      }
  
  
      class Pair {
          int a;
          int b;
  
          public Pair(int a, int b) {
              this.a = a;
              this.b = b;
          }
  
          void print() {
              System.out.println(a + " " + b);
          }
  
      }
  
      class segmentTree{
           int[] tree;
           int n;
           public segmentTree(int[] nums) {
               if (nums.length > 0) {
                   n = nums.length;
                   tree = new int[n * 2];
                   buildTree(nums);
               }
           }
  
           private void buildTree(int[] nums) {
               for (int i = n, j = 0;  i < 2 * n; i++,  j++)
                   tree[i] = nums[j];
               for (int i = n - 1; i > 0; --i)
                   tree[i] = tree[i * 2] + tree[i * 2 + 1];
           }
  
           void update(int pos, int val) {
               pos += n;
               tree[pos] = val;
               while (pos > 0) {
                   int left = pos;
                   int right = pos;
                   if (pos % 2 == 0) {
                       right = pos + 1;
                   } else {
                       left = pos - 1;
                   }
                   // parent is updated after child is updated
                   tree[pos / 2] = tree[left] + tree[right];
                   pos /= 2;
               }
           }
  
           public int sumRange(int l, int r) {
               // get leaf with value 'l'
               l += n;
               // get leaf with value 'r'
               r += n;
               int sum = 0;
               while (l <= r) {
                   if ((l % 2) == 1) {
                       sum += tree[l];
                       l++;
                   }
                   if ((r % 2) == 0) {
                       sum += tree[r];
                       r--;
                   }
                   l /= 2;
                   r /= 2;
               }
               return sum;
           }
  
       }
  
      int gcd(int a, int b) {
          if (b == 0)
              return a;
          return gcd(b, a % b);
      }
  
      long gcd(long a, long b) {
          if (b == 0)
              return a;
          return gcd(b, a % b);
      }
  
      long power(long x, long y, long p) {
          long res = 1;
  
  
          x = x % p;
  
          while (y > 0) {
  
              if ((y & 1) > 0)
                  res = (res * x) % p;
  
  
              y = y >> 1;
              x = (x * x) % p;
          }
          return res;
      }
  
  
      int lower_bound(int[] arr, int key) {
  
          int i = 0;
          int j = arr.length - 1;
          // if(arr[i] > key)return -1;
          if (arr[j] < key)
              return -1;
  
          while (i < j) {
              int mid = (i + j) / 2;
  
              if (arr[mid] == key) {
                  j = mid;
              } else if (arr[mid] < key) {
                  i = mid + 1;
              } else
                  j = mid - 1;
          }
  
          return i;
      }
  
      int upper_bound(int[] arr, int key) {
  
          int i = 0;
          int j = arr.length - 1;
          if (arr[j] <= key)
              return j + 1;
  
          while (i < j) {
              int mid = (i + j) / 2;
  
              if (arr[mid] <= key) {
                  i = mid + 1;
              } else
                  j = mid;
          }
  
          return i;
      }
  
      int find(int dsu[], int i) {
          if (dsu[i] == i)
              return i;
          dsu[i] = find(dsu, dsu[i]);
          return dsu[i];
      }
  
      void union(int dsu[], int i, int j) {
          int a = find(dsu, i);
          int b = find(dsu, j);
          dsu[a] = b;
      }
  
      static void sort(int[] a) {
          ArrayList<Integer> l = new ArrayList<>();
          for (int i : a)
              l.add(i);
          Collections.sort(l);
          for (int i = 0; i < a.length; i++)
              a[i] = l.get(i);
      }
  
      static void sort(long[] a) {
          ArrayList<Long> l = new ArrayList<>();
          for (long i : a)
              l.add(i);
          Collections.sort(l);
          for (int i = 0; i < a.length; i++)
              a[i] = l.get(i);
      }
  
      static String sort(String s) {
          Character ch[] = new Character[s.length()];
          for (int i = 0; i < s.length(); i++) {
              ch[i] = s.charAt(i);
          }
          Arrays.sort(ch);
          StringBuffer st = new StringBuffer("");
          for (int i = 0; i < s.length(); i++) {
              st.append(ch[i]);
          }
          return st.toString();
      }
  
      // long array input
      public long[] longArr(int len) {
          // long arr input
          long[] arr = new long[len];
          String[] strs = s.nextLine().trim().split("\\s+");
          for (int i = 0; i < len; i++) {
              arr[i] = Long.parseLong(strs[i]);
  
          }
          return arr;
      }
  
      // int arr input
      public int[] intArr(int len) {
          // long arr input
          int[] arr = new int[len];
          String[] strs = s.nextLine().trim().split("\\s+");
          for (int i = 0; i < len; i++) {
              arr[i] = Integer.parseInt(strs[i]);
  
          }
          return arr;
      }
  
      public void printArray(int[] A) {
          System.out.println(Arrays.toString(A));
      }
  
      public void printArray(long[] A) {
          System.out.println(Arrays.toString(A));
      }
  
  
  
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
  
          public FastReader() {
              br = new BufferedReader(new InputStreamReader(System.in));
          }
  
          String next() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
  
          double nextDouble() {
              return Double.parseDouble(next());
          }
  
          String nextLine() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
  
  }
  