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.*;
  import java.util.*;
   
  public class a {
      FastScanner scn;
      PrintWriter w;
      PrintStream fs;
  
      long MOD = 1000000007;
      int N=100000+10;
      long mul(long x, long y) {long res = x * y; return (res >= MOD ? res % MOD : res);}
      long power(long x, long y) {if (y < 0) return 1; long res = 1; x %= MOD; while (y!=0) {if ((y & 1)==1)res = mul(res, x); y >>= 1; x = mul(x, x);} return res;}
      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), temp=a[i];a[i]=a[oi];a[oi]=temp;}Arrays.sort(a);}
      boolean LOCAL;
      void debug(Object... o){if(LOCAL)System.err.println(Arrays.deepToString(o));}
      
      void solve(){
  
          int t=scn.nextInt();
              while(t-->0)
              {
                  int n=scn.nextInt();
                  long ans=1;
                  for(int i=3;i<=2*n;i++){
                      ans=mul(ans,i);
                  }  
  
                  w.println(ans);
              
              }
          
      }
   
      void run() {
          try {
              long ct = System.currentTimeMillis();
              scn = new FastScanner(new File("input.txt"));
              w = new PrintWriter(new File("output.txt"));
              fs=new PrintStream("error.txt");
              System.setErr(fs);
              LOCAL=true;
   
              solve();
   
              w.close();
              System.err.println(System.currentTimeMillis() - ct);
          } catch (FileNotFoundException e) {
              e.printStackTrace();
          }
      }
   
      void runIO() {
   
          scn = new FastScanner(System.in);
          w = new PrintWriter(System.out);
          LOCAL=false;
   
          solve();
   
          w.close();
      }
   
      class FastScanner {
          BufferedReader br;
          StringTokenizer st;
   
          public FastScanner(File f) {
              try {
                  br = new BufferedReader(new FileReader(f));
              } catch (FileNotFoundException e) {
                  e.printStackTrace();
              }
          }
   
          public FastScanner(InputStream f) {
              br = new BufferedReader(new InputStreamReader(f));
          }
   
          String next() {
              while (st == null || !st.hasMoreTokens()) {
                  String s = null;
                  try {
                      s = br.readLine();
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
                  if (s == null)
                      return null;
                  st = new StringTokenizer(s);
              }
              return st.nextToken();
          }
   
          boolean hasMoreTokens() {
              while (st == null || !st.hasMoreTokens()) {
                  String s = null;
                  try {
                      s = br.readLine();
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
                  if (s == null)
                      return false;
                  st = new StringTokenizer(s);
              }
              return true;
          }
   
          int nextInt() {
              return Integer.parseInt(next());
          }
          
          int[] nextIntArray(int n) {
              int a[] = new int[n];
              for (int i = 0; i < n; i++) {
                  a[i] = nextInt();
              }
              return a;
          }
  
          long[] nextLongArray(int n) {
              long a[] = new long[n];
              for (int i = 0; i < n; i++) {
                  a[i] = nextLong();
              }
              return a;
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
   
          double nextDouble() {
              return Double.parseDouble(next());
          }
      }
   
      public static void main(String[] args) {
          new a().runIO();
      }
  }
  