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.BigInteger;
  
  public class P04 {
  	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());
  		}
  		
  		float nextFloat() {
  			return Float.parseFloat(next());
  		}
  		String nextLine() {
  			String str = "";
  			try {
  				str = br.readLine();
  			}catch(IOException e) {
  				e.printStackTrace();
  			}
  			return str ;
  		}
  	}
  	static void swap(int[] arr, int i, int j)
  	{
  	    int temp = arr[i];
  	    arr[i] = arr[j];
  	    arr[j] = temp;
  	}
  
  	static int partition(int[] arr, int low, int high)
  	{	   
  	    long pivot = arr[high];   
  	    int i = (low - 1);
  	    for(int j = low; j <= high - 1; j++)
  	    {    
  	        if (arr[j] < pivot)
  	        {          
  	            i++;
  	            swap(arr, i, j);
  	        }
  	    }
  	    swap(arr, i + 1, high);
  	    return (i + 1);
  	}
  	static void quickSort(int[] arr, int low, int high)
  	{
  	    if (low < high)
  	    {  
  	        int pi = partition(arr, low, high);
  	        quickSort(arr, low, pi - 1);
  	        quickSort(arr, pi + 1, high);
  	    }
  	}
  	public static long binarySearch(long arr[], long key){  
  		  int  first =0,last =arr.length-1;
  		   int mid = (first + last)/2;  
  		   while( first <= last ){  
  		      if ( arr[mid] < key ){  
  		        first = mid + 1;     
  		      }else if ( arr[mid] == key ){  
  		    	 return mid;  
  		      }else{  
  		         last = mid - 1;  
  		      }  
  		      mid = (first + last)/2;  
  		   }  
  		   if ( first > last ){ 
  			   return -1;
  		       
  		   } 
  		   return -1;
  		 }  
  	static long fp(long a , long b , int n) {
  		long res =1;
  		while(b>0) {
  			if((b&1)!=0) {             //when b is odd 
  				res=(res*a%n)%n;
  			}
  			a=(a%n*a%n)%n;
  			b=b>>1;
  		}
  		return res;
  	}
  	static long gcd (long a ,long b) {
  		if(b==0) {
  			return a;
  		}
  		return gcd(b,a%b);
  	}
  	
  	public static void main(String[] args) {
  		Scanner sc = new Scanner (System.in);
  		FastReader fs = new FastReader();
  		int t = fs.nextInt();
  		while(t-->0) {
  			int n= fs.nextInt();
  			for(int i =0;i<n;i++) {
  				System.out.print("(");
  			}
  			for(int i =0;i<n;i++) {
  				System.out.print(")");
  			}
  			System.out.println();
  			if(n>=2) {
  				for(int i =0;i<n;i++) {
  					System.out.print("()");
  				}
  				System.out.println();
  			}
  			if(n>=3) {
  				for(int i =2;i<=n-1;i++) {
  					System.out.print("(");
  					for(int j=0;j<i;j++) {
  						System.out.print("()");
  					}
  					System.out.print(")");
  					for(int j=0;j<n-1-i;j++) {
  						System.out.print("()");
  					}
  					System.out.println();
  				}
  			}
  			//System.out.println();
  		}
  		
      }
  	
  
  	private static String reduce(String s) {
  		String ans ="";
  		ans+=s.charAt(0);
  		for(int i =1;i<s.length();i++) {
  			if(s.charAt(i)!=s.charAt(i-1)) {
  				ans+=s.charAt(i);
  			}
  		}
  	//	if(s.charAt(s.length()-1)!=s.charAt(s.length()-2))ans+=s.charAt(s.length()-1);
  		return ans;
  	}
  
  	
  
  	private static void pa(int[] a) {
  		for(int i =0;i<a.length;i++) {
  			System.out.print(a[i]+" ");
  		}
  		System.out.println();
  		
  	}
  
  	private static long sumofn(long n) {
  		int ans = 0;
  		while(n>9) {
  			ans+=n%10;
  			n/=10;
  		}
  		ans+=n;
  		return ans;
  	}
  	private static boolean palin(String s) {
  		int i =0,j=s.length()-1;
  		while(i<j) {
  			if(s.charAt(i)!=s.charAt(j))return false;
  			else {
  				i++;
  				j--;
  			}
  		}
  		return true;
  	}
  }
  			
  
  
  