description: CQXYM is counting permutations length of 2n.
  
  A permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a permutation (n=3 but there is 4 in the array).
  
  A permutation p(length of 2n) will be counted only if the number of i satisfying p_i<p_{i+1} is no less than n. For example:
  
    * Permutation [1, 2, 3, 4] will count, because the number of such i that p_i<p_{i+1} equals 3 (i = 1, i = 2, i = 3).
    * Permutation [3, 2, 1, 4] won't count, because the number of such i that p_i<p_{i+1} equals 1 (i = 3). 
  
  
  
  CQXYM wants you to help him to count the number of such permutations modulo 1000000007 (10^9+7).
  
  In addition, [modulo operation](https://en.wikipedia.org/wiki/Modulo_operation) is to get the remainder. For example:
  
    * 7 mod 3=1, because 7 = 3 ⋅ 2 + 1, 
    * 15 mod 4=3, because 15 = 4 ⋅ 3 + 3. 
  
  Input
  
  The input consists of multiple test cases. 
  
  The first line contains an integer t (t ≥ 1) — the number of test cases. The description of the test cases follows.
  
  Only one line of each test case contains an integer n(1 ≤ n ≤ 10^5).
  
  It is guaranteed that the sum of n over all test cases does not exceed 10^5
  
  Output
  
  For each test case, print the answer in a single line.
  
  Example
  
  Input
  
  
  4
  1
  2
  9
  91234
  
  
  Output
  
  
  1
  12
  830455698
  890287984
  
  Note
  
  n=1, there is only one permutation that satisfies the condition: [1,2].
  
  In permutation [1,2], p_1<p_2, and there is one i=1 satisfy the condition. Since 1 ≥ n, this permutation should be counted. In permutation [2,1], p_1>p_2. Because 0<n, this permutation should not be counted.
  
  n=2, there are 12 permutations: [1,2,3,4],[1,2,4,3],[1,3,2,4],[1,3,4,2],[1,4,2,3],[2,1,3,4],[2,3,1,4],[2,3,4,1],[2,4,1,3],[3,1,2,4],[3,4,1,2],[4,1,2,3].
solution: import java.util.*; import java.io.*; import java.math.*;
  public class Main{
  	//見なくていいよ　ここから------------------------------------------
  	static class InputIterator{
  		ArrayList<String> inputLine = new ArrayList<>(1024);
  		int index = 0; int max; String read;
  		InputIterator(){
  			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  			try{
  				while((read = br.readLine()) != null){
  					inputLine.addAll(Arrays.asList(read.split(" ")));
  				}
  			}catch(IOException e){}
  			max = inputLine.size();
  		}
  		boolean hasNext(){return (index < max);}
  		String next(){
  			if(hasNext()){
  				return inputLine.get(index++);
  			}else{
  				throw new IndexOutOfBoundsException("There is no more input");
  			}
  		}
  	}
  	static HashMap<Integer, String> CONVSTR = new HashMap<>();
  	static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
  	static PrintWriter out = new PrintWriter(System.out);
  	static void flush(){out.flush();}
  	static void myout(Object t){out.println(t);}
  	static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
  	static String next(){return ii.next();}
  	static boolean hasNext(){return ii.hasNext();}
  	static int nextInt(){return Integer.parseInt(next());}
  	static long nextLong(){return Long.parseLong(next());}
  	static double nextDouble(){return Double.parseDouble(next());}
  	static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
  	static ArrayList<String> nextStrArray(int size){
  		ArrayList<String> ret = new ArrayList<>(size);
  		for(int i = 0; i < size; i++){
  			ret.add(next());
  		}
  		return ret;
  	}
  	static ArrayList<Integer> nextIntArray(int size){
  		ArrayList<Integer> ret = new ArrayList<>(size);
  		for(int i = 0; i < size; i++){
  			ret.add(Integer.parseInt(next()));
  		}
  		return ret;
  	}
  	static ArrayList<Long> nextLongArray(int size){
  		ArrayList<Long> ret = new ArrayList<>(size);
  		for(int i = 0; i < size; i++){
  			ret.add(Long.parseLong(next()));
  		}
  		return ret;
  	}
  	@SuppressWarnings("unchecked")
  	static String myconv(Object list, int no){//only join
  		StringBuilder sb = new StringBuilder("");
  		String joinString = CONVSTR.get(no);
  		if(list instanceof String[]){
  			return String.join(joinString, (String[])list);
  		}else if(list instanceof long[]){
  			long[] tmp = (long[])list;
  			if(tmp.length == 0){
  				return "";
  			}
  			sb.append(String.valueOf(tmp[0]));
  			for(int i = 1; i < tmp.length; i++){
  				sb.append(joinString).append(String.valueOf(tmp[i]));
  			}
  			return sb.toString();
  		}else if(list instanceof int[]){
  			int[] tmp = (int[])list;
  			if(tmp.length == 0){
  				return "";
  			}
  			sb.append(String.valueOf(tmp[0]));
  			for(int i = 1; i < tmp.length; i++){
  				sb.append(joinString).append(String.valueOf(tmp[i]));
  			}
  			return sb.toString();
  		}else if(list instanceof ArrayList){
  			ArrayList tmp = (ArrayList)list;
  			if(tmp.size() == 0){
  				return "";
  			}
  			sb.append(tmp.get(0));
  			for(int i = 1; i < tmp.size(); i++){
  				sb.append(joinString).append(tmp.get(i));
  			}
  			return sb.toString();
  		}else{
  			throw new ClassCastException("Don't join");
  		}
  	}
  	static ArrayList<String> myconv(String str, int no){//only split
  		String splitString = CONVSTR.get(no);
  		return new ArrayList<String>(Arrays.asList(str.split(splitString)));
  	}
  	static ArrayList<String> myconv(String str, String no){
  		return new ArrayList<String>(Arrays.asList(str.split(no)));
  	}
  	public static void main(String[] args){
  		CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
  		solve();flush();
  	}
  	//見なくていいよ　ここまで------------------------------------------
  	//このコードをコンパイルするときは、「-encoding UTF-8」を指定すること
  	static void solve(){//ここがメイン関数
  		int t = nextInt();
  		int mod = 1000000007;
  		while(hasNext()){
  			int N = nextInt() * 2;
  			long output = 1;
  			for(int i = 3; i <= N; i++){
  				output *= i;
  				output %= mod;
  			}
  			myout(output);
  		}
  	}
  	//メソッド追加エリア　ここから
  
  
  
  	//メソッド追加エリア　ここまで
  }
  