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 static java.lang.Math.*;
  import java.io.*;
  import java.math.*;
  import java.util.*;
  
  public class cf2 {
  	static FastReader x = new FastReader();
  	static OutputStream outputStream = System.out;
  	static PrintWriter out = new PrintWriter(outputStream);
  
  	/*---------------------------------------CODE STARTS HERE-------------------------*/
  	public static void main(String[] args) {
  
  		int t = x.nextInt();
  		StringBuilder str = new StringBuilder();
  		while (t > 0) {
  			int n = x.nextInt();
  			int count=0,l=0;
  			for(int i=n;i>0;i--) {
  				l=0;
  				int p=0;
  				while(p<i) {
  					System.out.print('(');
  					l++;
  					count++;
  					p++;
  				}
  				while(count>0) {
  					System.out.print(')');
  					count--;
  					l++;
  				}
  				int rem=2*n-l;
  				rem=rem/2;
  				while(rem>0) {
  					System.out.print('(');
  					l++;
  					rem--;
  				}
  				while(l<2*n) {
  					System.out.print(')');
  					l++;
  				}
  				System.out.println("");
  			}
  			str.append("\n");
  			t--;
  		}
  		out.println(str);
  		out.flush();
  	}
  
  	/*--------------------------------------------FAST I/O--------------------------------*/
  	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;
  		}
  
  		char nextchar() {
  			char ch = ' ';
  			try {
  				ch = (char) br.read();
  			} catch (IOException e) {
  				e.printStackTrace();
  			}
  			return ch;
  		}
  	}
  
  	/*--------------------------------------------BOILER PLATE---------------------------*/
  	static int[] readarr(int n) {
  		int arr[] = new int[n];
  		for (int i = 0; i < n; i++) {
  			arr[i] = x.nextInt();
  		}
  		return arr;
  	}
  
  	static int[] sortint(int a[]) {
  		ArrayList<Integer> al = new ArrayList<>();
  		for (int i : a) {
  			al.add(i);
  		}
  		Collections.sort(al);
  		for (int i = 0; i < a.length; i++) {
  			a[i] = al.get(i);
  		}
  		return a;
  	}
  
  	static long[] sortlong(long a[]) {
  		ArrayList<Long> al = new ArrayList<>();
  		for (long i : a) {
  			al.add(i);
  		}
  		Collections.sort(al);
  		for (int i = 0; i < al.size(); i++) {
  			a[i] = al.get(i);
  		}
  		return a;
  	}
  
  	static int pow(int x, int y) {
  		int result = 1;
  		while (y > 0) {
  			if (y % 2 == 0) {
  				x = x * x;
  				y = y / 2;
  			} else {
  				result = result * x;
  				y = y - 1;
  			}
  		}
  		return result;
  	}
  
  	static int[] revsort(int a[]) {
  		ArrayList<Integer> al = new ArrayList<>();
  		for (int i : a) {
  			al.add(i);
  		}
  		Collections.sort(al, Comparator.reverseOrder());
  		for (int i = 0; i < a.length; i++) {
  			a[i] = al.get(i);
  		}
  		return a;
  	}
  
  	static int[] gcd(int a, int b, int ar[]) {
  		if (b == 0) {
  			ar[0] = a;
  			ar[1] = 1;
  			ar[2] = 0;
  			return ar;
  		}
  		ar = gcd(b, a % b, ar);
  		int t = ar[1];
  		ar[1] = ar[2];
  		ar[2] = t - (a / b) * ar[2];
  		return ar;
  	}
  
  	static boolean[] esieve(int n) {
  		boolean p[] = new boolean[n + 1];
  		Arrays.fill(p, true);
  		for (int i = 2; i * i <= n; i++) {
  			if (p[i] == true) {
  				for (int j = i * i; j <= n; j += i) {
  					p[j] = false;
  				}
  			}
  		}
  		return p;
  	}
  
  	static ArrayList<Integer> primes(int n) {
  		boolean p[] = new boolean[n + 1];
  		ArrayList<Integer> al = new ArrayList<>();
  		Arrays.fill(p, true);
  		int i = 0;
  		for (i = 2; i * i <= n; i++) {
  			if (p[i] == true) {
  				al.add(i);
  				for (int j = i * i; j <= n; j += i) {
  					p[j] = false;
  				}
  			}
  		}
  		for (i = i; i <= n; i++) {
  			if (p[i] == true) {
  				al.add(i);
  			}
  		}
  		return al;
  	}
  
  	static int etf(int n) {
  		int res = n;
  		for (int i = 2; i * i <= n; i++) {
  			if (n % i == 0) {
  				res /= i;
  				res *= (i - 1);
  				while (n % i == 0) {
  					n /= i;
  				}
  			}
  		}
  		if (n > 1) {
  			res /= n;
  			res *= (n - 1);
  		}
  		return res;
  	}
  
  	static int gcd(int a, int b) {
  		if (a == 0) {
  			return b;
  		}
  		return gcd(b % a, a);
  	}
  
  	static long gcd(long a, long b) {
  		if (a == 0) {
  			return b;
  		}
  		return gcd(b % a, a);
  	}
  }