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.BufferedReader;
  import java.io.IOException;
  import java.util.Collections;
  import java.io.InputStreamReader;
  import java.util.ArrayList;
  import java.util.Arrays;
  import java.util.Random;
  import java.util.StringTokenizer;
  public class A{
  // author: Tarun Verma
  	static FastScanner sc = new FastScanner();
  	static int inf = Integer.MAX_VALUE;
  	static long mod = 1000000007;
  	
  	/* Common Mistakes By Me
  	 * make sure to read the bottom part of question
  	 * special cases (n=1?)
  	 * In Game Theory Check your solution and consider all the solutions
  	 * Always initialise value to the declare array in local scope
  	 * don't use debugs in interactive problems
  	 * Always Reset vis,adj array upto n+1 otherwise can cause TLE
  	 */
  
  	public static void solve() {
  		int n = sc.nextInt();
  		String s = "";
  		for(int i =0;i<n;i++) {
  			s= s+ "(";
  		}
  		for(int i =0;i<n;i++) {
  			s= s+ ")";
  		}
  		System.out.println(s);
  		String res= "";
  		for(int i =0;i<n-1;i++) {
  			for(int  j = 0;j<i+1;j++) {
  				System.out.print("()");
  			}
  			s = s.substring(1, s.length() - 1);
  			System.out.print(s);
  			System.out.println();
  		}
  	}
  	
  	public static void main(String[] args) {
  		int t = 1;
  		t = sc.nextInt();
  		outer: for (int tt = 0; tt < t; tt++) {
  			solve();
  		}
  	}
  	
  ////////////////////////////////////////////////////////////////////////////////////
  ////////////////////DO NOT BELOW BEFORE THIS LINE //////////////////////////////////
  ////////////////////////////////////////////////////////////////////////////////////
  	
  	static boolean isPalindrom(char[] arr, int i, int j) {
  		boolean ok = true;
  		while (i <= j) {
  			if (arr[i] != arr[j]) {
  				ok = false;
  				break;
  			}
  			i++;
  			j--;
  		}
  		return ok;
  	}
  	
  	static int max(int a, int b) {
  		return Math.max(a, b);
  	}
  	
  	static int min(int a, int b) {
  		return Math.min(a, b);
  	}
  	
  	static long max(long a, long b) {
  		return Math.max(a, b);
  	}
  	
  	static long min(long a, long b) {
  		return Math.min(a, b);
  	}
  	static void sort(int arr[]) {
  		ArrayList<Integer> a = new ArrayList<Integer>();
  		for(int i: arr) a.add(i);
  		Collections.sort(a);
  		for(int i=0;i<arr.length;i++) arr[i] = a.get(i);
  	}
  	static int abs(int a) {
  		return Math.abs(a);
  	}
  	
  	static long abs(long a) {
  		return Math.abs(a);
  	}
  	
  	static void swap(long arr[], int i, int j) {
  		long temp = arr[i];
  		arr[i] = arr[j];
  		arr[j] = temp;
  	}
  	
  	static void swap(int arr[], int i, int j) {
  		int temp = arr[i];
  		arr[i] = arr[j];
  		arr[j] = temp;
  	}
  	
  	static int maxArr(int arr[]) {
  		int maxi = Integer.MIN_VALUE;
  		for (int x : arr)
  			maxi = max(maxi, x);
  		return maxi;
  	}
  	
  	static int minArr(int arr[]) {
  		int mini = Integer.MAX_VALUE;
  		for (int x : arr)
  			mini = min(mini, x);
  		return mini;
  	}
  	
  	static long maxArr(long arr[]) {
  		long maxi = Long.MIN_VALUE;
  		for (long x : arr)
  			maxi = max(maxi, x);
  		return maxi;
  	}
  	
  	static long minArr(long arr[]) {
  		long mini = Long.MAX_VALUE;
  		for (long x : arr)
  			mini = min(mini, x);
  		return mini;
  	}
  	
  	static int gcd(int a, int b) {
  		if (b == 0)
  			return a;
  		return gcd(b, a % b);
  	}
  	
  	static long gcd(long a, long b) {
  		if (b == 0)
  			return a;
  		return gcd(b, a % b);
  	}
  	
  	static void ruffleSort(int[] a) {
  		int n = a.length;
  		Random r = new Random();
  		for (int i = 0; i < a.length; i++) {
  			int oi = r.nextInt(n);
  			int temp = a[i];
  			a[i] = a[oi];
  			a[oi] = temp;
  		}
  		Arrays.sort(a);
  	}
  	
  	public static int binarySearch(int a[], int target) {
  		int left = 0;
  		int right = a.length - 1;
  		int mid = (left + right) / 2;
  		int i = 0;
  		while (left <= right) {
  			if (a[mid] <= target) {
  				i = mid + 1;
  				left = mid + 1;
  			} else {
  				right = mid - 1;
  			}
  			mid = (left + right) / 2;
  		}
  		return i;
  	}
  	
  	static class FastScanner {
  		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  		StringTokenizer st = new StringTokenizer("");
  		
  		String next() {
  			while (!st.hasMoreTokens())
  				try {
  					st = new StringTokenizer(br.readLine());
  				} catch (IOException e) {
  					e.printStackTrace();
  				}
  			return st.nextToken();
  		}
  		
  		int nextInt() {
  			return Integer.parseInt(next());
  		}
  		
  		int[] readArray(int n) {
  			int[] a = new int[n];
  			for (int i = 0; i < n; i++)
  				a[i] = nextInt();
  			return a;
  		}
  		
  		long[] readLongArray(int n) {
  			long[] a = new long[n];
  			for (int i = 0; i < n; i++)
  				a[i] = nextLong();
  			return a;
  		}
  		
  		int[][] read2dArray(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;
  		}
  		
  		ArrayList<Integer> readArrayList(int n) {
  			ArrayList<Integer> arr = new ArrayList<Integer>();
  			for (int i = 0; i < n; i++) {
  				int a = nextInt();
  				arr.add(a);
  			}
  			return arr;
  		}
  		
  		long nextLong() {
  			return Long.parseLong(next());
  		}
  	}
  	
  	static class pair {
  		int fr, sc;
  		
  		pair(int fr, int sc) {
  			this.fr = fr;
  			this.sc = sc;
  		}
  	}
  	
  ////////////////////////////////////////////////////////////////////////////////////	
  	
  }
  