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.io.BufferedReader;
  import java.io.File;
  import java.io.FileNotFoundException;
  import java.io.FileReader;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.InputStreamReader;
  import java.io.OutputStream;
  import java.io.PrintWriter;
  import java.util.ArrayList;
  import java.util.Arrays;
  import java.util.Collections;
  import java.util.Comparator;
  import java.util.HashMap;
  import java.util.HashSet;
  import java.util.LinkedList;
  import java.util.List;
  import java.util.Map;
  import java.util.Queue;
  import java.util.Set;
  import java.util.StringTokenizer;
  import java.util.TreeMap;
  import java.util.TreeSet;
  import java.util.stream.Collectors;
  
  
  public class Main {
  
  	static class Task {
  		
  		int NN = 200005;
  		int MOD = 1000000007;
  		int INF = 2000000000;
  		long INFINITY = 2000000000000000000L;
  
  		class Tuple {
  			Integer [] a;
  			public Tuple(Integer... x){
  				this.a = x;
  			}
  		}
  
  		public void solve(InputReader in, PrintWriter out) {
  			long [] a = new long[200005];
  			a[0] = 1;
  			for(int i=1;i<200005;++i) {
  				a[i] = (a[i - 1] * 1L * i)%MOD;
  			}
  			int  t = in.nextInt();
  			while(t-->0){
  				int n = in.nextInt();
  				out.println((a[2*n]*e(2L, MOD-2)%MOD));
  			}
  		}
  
  		long e(long x, long n) {
  			long r = 1, s = x;
  			while(n>0) {
  				if(n%2!=0){
  					r=(r*s)%MOD;
  				}
  				n/=2;s=(s*s)%MOD;
  			}
  			return r;
  		}
  
  
  
  
  		class C {
  			Map<Integer, Integer> mp;
  			public C() {
  				mp = new HashMap<>();
  				for(int i=0;i<10000000;++i) {
  					mp.put(i, i*3);
  				}
  			}
  		}
  
  		void p(PrintWriter out) {
  			out.println(usedBytes());
  		}
  
  		String usedBytes() {
  			return (Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory()) + " bytes";
  		}
  
  
  	}
  	
  	static void prepareIO(boolean isFileIO) {
  		//long t1 = System.currentTimeMillis();
  		Task solver = new Task();
  		// Standard IO
  		if(!isFileIO) { 
  			InputStream inputStream = System.in;
  	        OutputStream outputStream = System.out;
  	        InputReader in = new InputReader(inputStream);
  	        PrintWriter out = new PrintWriter(outputStream);
  	        solver.solve(in, out);
  	        //out.println("time(s): " + (1.0*(System.currentTimeMillis()-t1))/1000.0);
  	        out.close();
  		}
          // File IO
  		else {
  			String IPfilePath = System.getProperty("user.home") + "/Downloads/ip.in";
  	        String OPfilePath = System.getProperty("user.home") + "/Downloads/op.out";
  	        InputReader fin = new InputReader(IPfilePath);
  	        PrintWriter fout = null;
  	        try {
  				fout = new PrintWriter(new File(OPfilePath));
  			} catch (FileNotFoundException e) {
  				e.printStackTrace();
  			}
  	        solver.solve(fin, fout);
  	        //fout.println("time(s): " + (1.0*(System.currentTimeMillis()-t1))/1000.0);
  	        fout.close();
  		}
  	}
  	
  	public static void main(String[] args) {
          prepareIO(false);
  	}
  	
  	static class InputReader {
          public BufferedReader reader;
          public StringTokenizer tokenizer;
  
          public InputReader(InputStream stream) {
              reader = new BufferedReader(new InputStreamReader(stream), 32768);
              tokenizer = null;
          }
          
          public InputReader(String filePath) {
          	File file = new File(filePath);
              try {
  				reader = new BufferedReader(new FileReader(file));
  			} catch (FileNotFoundException e) {
  				// TODO Auto-generated catch block
  				e.printStackTrace();
  			}
              tokenizer = null;
          }
          
          public String nextLine() {
          	String str = "";
          	try {
  				str = reader.readLine();
  			} catch (IOException e) {
  				// TODO Auto-generated catch block
  				e.printStackTrace();
  			}
          	return str;
          }
          
          public String next() {
              while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                  try {
                      tokenizer = new StringTokenizer(reader.readLine());
                  } catch (IOException e) {
                      throw new RuntimeException(e);
                  }
              }
              return tokenizer.nextToken();
          }
  
          public int nextInt() {
              return Integer.parseInt(next());
          }
  
          public long nextLong() {
              return Long.parseLong(next());
          }
  
          public double nextDouble() {
          	return Double.parseDouble(next());
          }
          
      }
  
  }