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: /**
   * @author -- Sourav Joshi
   */
  import java.util.*;
  import static java.lang.Math.max;
  import static java.lang.Math.min;
  import static java.lang.Math.abs;
  import static java.lang.Math.ceil;
  import static java.lang.Math.max;
  import static java.lang.Math.pow;
  import java.io.*;
  public class Codeforces {
  /*----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------*/
  static FastScanner s = new FastScanner();
  static FastWriter out = new FastWriter();
  final static int mod = 1000000000 + 7;
  final static int INT_MAX = Integer.MAX_VALUE;
  final static int INT_MIN = Integer.MIN_VALUE;
  final static long LONG_MAX = Long.MAX_VALUE;
  final static long LONG_MIN = Long.MIN_VALUE;
  final static double DOUBLE_MAX = Double.MAX_VALUE;
  final static double DOUBLE_MIN = Double.MIN_VALUE;
  final static float FLOAT_MAX = Float.MAX_VALUE;
  final static float FLOAT_MIN = Float.MIN_VALUE;
  /*----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------*/
  static class FastScanner{BufferedReader br;StringTokenizer st;
  public FastScanner() {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());}
  String nextLine(){String str = "";try{str = br.readLine();}catch (IOException e){e.printStackTrace();}return str;}}
  static class FastWriter{private final BufferedWriter bw;public FastWriter() {this.bw = new BufferedWriter(new OutputStreamWriter(System.out));}
  public void print(Object object) throws IOException{bw.append(""+ object);}
  public void println(Object object) throws IOException{print(object);bw.append("\n");}
  public void close() throws IOException{bw.close();}}
  /*----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------*/
  public static ArrayList<Integer> seive(int n){ArrayList<Integer> list = new ArrayList<>();int arr[] = new int[n+1];for(int i = 2; i <= n; i++) {if(arr[i] == 1) {continue;}else {list.add(i);for(int j = i*i; j <= n; j = j + i) {arr[j] = 1;}}}return list;}
  public static long gcd(long a, long b){if(a > b) {a = (a+b)-(b=a);}if(a == 0L){return b;}return gcd(b%a, a);}
  public static void swap(int[] arr, int i, int j) {arr[i] = arr[i] ^ arr[j]; arr[j] = arr[j] ^ arr[i]; arr[i] = arr[i] ^ arr[j];}
  public static boolean isPrime(long n){if(n < 2){return false;}if(n == 2 || n == 3){return true;}if(n%2 == 0 || n%3 == 0){return false;}long sqrtN = (long)Math.sqrt(n)+1;for(long i = 6L; i <= sqrtN; i += 6) {if(n%(i-1) == 0 || n%(i+1) == 0) return false;}return true;}
  public static void takeintarr(int arr[][]) {for(int i = 0; i < arr.length; i++) {for(int j = 0; j < arr[0].length; j++) {arr[i][j] = s.nextInt();}}}
  public static void takeintarr(int arr[]) {for(int i = 0; i < arr.length; i++) {arr[i] = s.nextInt();}}
  public static long mod_add(long a, long b){ return (a%mod + b%mod)%mod;}
  public static long mod_sub(long a, long b){ return (a%mod - b%mod + mod)%mod;}
  public static long mod_mul(long a, long b){ return (a%mod * b%mod)%mod;}
  public static long modInv(long a, long b){ return expo(a, b-2)%b;}
  public static long mod_div(long a, long b){return mod_mul(a, modInv(b, mod));}
  public static long expo(long a, long b){long res = 1;while(b > 0){if(b % 2 != 0){res = mod_mul(a, res);b--;}else{a = mod_mul(a,a);b = b/2;}}return res;}
  public static void printdoublearr(double arr[][]) {for(int i = 0 ; i < arr.length; i++) {for(int j = 0; j < arr[0].length; j++) {System.out.print(arr[i][j]+" ");}System.out.println();}}
  public static void printlongarr(long arr[][]) {for(int i = 0 ; i < arr.length; i++) {for(int j = 0; j < arr[0].length; j++) {System.out.print(arr[i][j]+" ");}System.out.println();}}
  public static void printintarr(int arr[][]) {for(int i = 0 ; i < arr.length; i++) {for(int j = 0; j < arr[0].length; j++) {System.out.print(arr[i][j]+" ");}System.out.println();}}
  public static void printlongarr(long[] arr) {for(int i = 0; i < arr.length; i++) {System.out.print(arr[i]+" ");}}
  public static void printintarr(int[] arr) {for(int i = 0; i < arr.length; i++) {System.out.print(arr[i]+" ");}}
  public static void printdoublearr(double[] arr) {for(int i = 0; i < arr.length; i++) {System.out.print(arr[i]+" ");}}
  
  /*----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------*/
      static long[] fact = new long[200000+10];
      public static void compute(){
          fact[0] = 1;
          for(int i = 1; i < fact.length; i++){
              fact[i] = mod_mul(fact[i-1], i);
          }
      }
      public static void main(String[] args) throws IOException {
          int test = s.nextInt();
          compute();
          while (test-- > 0) {
              int n = s.nextInt();
              long ans = mod_div(fact[2*n], 2);
              out.println(ans);
          }
          out.close();
      }
  
  }
  
  