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.lang.*;
  import java.io.*;
  public class Main  
  {
      static FastReader sc =new FastReader();
      static int mod=1000000007;
      
         public static void main(String [] args)
      {
          PrintWriter out=new PrintWriter(System.out);
  		StringBuilder sb = new StringBuilder();
          int t = i();
          while(t-->0)
          {
              long n = l();
              long ans = 1;
              for(long i = 3;i<=2*n;i++)
              {
                  ans = (ans*i)%mod;
              }
              System.out.println(ans);
          }
              
          out.close();
      
  }
     
      
      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()); 
          } 
  
          String nextLine() 
          { 
              String str = ""; 
              try
              { 
                  str = br.readLine(); 
              } 
              catch (IOException e) 
              { 
                  e.printStackTrace(); 
              } 
              return str; 
          } 
      } 
  
      static int i() {
          return sc.nextInt();
      }
  
      static String s() {
          return sc.next();
      }
  
      static long l() {
          return sc.nextLong();
      }
  
      static char[] inputC()
      {
          String s = sc.nextLine();
          return s.toCharArray();
      }
  
      static int[] input(int n) {
          int A[]=new int[n];
             for(int i=0;i<n;i++) {
                 A[i]=sc.nextInt();
             }
          return A;
      }
  
      static long[] inputL(int n) {
          long A[]=new long[n];
             for(int i=0;i<n;i++) {
                 A[i]=sc.nextLong();
             }
             return A;
      }
  
      static long[] putL(long a[]) {
          long A[]=new long[a.length];
             for(int i=0;i<a.length;i++) {
                 A[i]=a[i];
             }
             return A;
      }
  
      static String[] inputS(int n) {
          String A[]=new String[n];
             for(int i=0;i<n;i++) {
                 A[i]=sc.next();
             }
             return A;
      }
      // static List<Integer> sort(List<Integer> list)
      // {
      //     Collections.sort(list);
      //     return list;
      // }
  
      // static List<Integer> sortR(List<Integer> list)
      // {
      //     Collections.sort(list,Collections.reverseOrder());
      //     return list;
      // }
  
      // static List<Long> sort(List<Long> list)
      // {
      //     Collections.sort(list);
      //     return list;
      // }
  
      // static List<Long> sortR(List<Long> list)
      // {
      //     Collections.sort(list,Collections.reverseOrder());
      //     return list;
      // }
  
      // static List<String> sortS(List<String> list)
      // {
      //     Collections.sort(list);
      //     return list;
      // }
  
      // static List<String> sortRS(List<String> list)
      // {
      //     Collections.sort(list,Collections.reverseOrder());
      //     return list;
      // }
  
      static int gcd(int a, int b) 
       { 
           if (a == 0) 
               return b; 
           return gcd(b % a, a); 
       } 
  
       static long gcd(long a, long b) 
       { 
           if (a == 0) 
               return b; 
           return gcd(b % a, a); 
       } 
  
       
      
       static String reverse(String s) {
          StringBuffer p=new StringBuffer(s);
          p.reverse();
          return p.toString();
       }
  
       static int min(int a,int b) {
          return Math.min(a, b);
      }
      static int min(int a,int b,int c) {
          return Math.min(a, Math.min(b, c));
      }
      static int min(int a,int b,int c,int d) {
          return Math.min(a, Math.min(b, Math.min(c, d)));
      }
  
      static int max(int a,int b) {
          return Math.max(a, b);
      }
      static int max(int a,int b,int c) {
          return Math.max(a, Math.max(b, c));
      }
      static int max(int a,int b,int c,int d) {
          return Math.max(a, Math.max(b, Math.max(c, d)));
      }
      static long min(long a,long b) {
          return Math.min(a, b);
      }
      static long min(long a,long b,long c) {
          return Math.min(a, Math.min(b, c));
      }
      static long min(long a,long b,long c,long d) {
          return Math.min(a, Math.min(b, Math.min(c, d)));
      }
      static long max(long a,long b) {
          return Math.max(a, b);
      }
      static long max(long a,long b,long c) {
          return Math.max(a, Math.max(b, c));
      }
      static long max(long a,long b,long c,long d) {
          return Math.max(a, Math.max(b, Math.max(c, d)));
      }
  
      static long sum(int A[]) {
          long sum=0;
          for(int i : A) {
              sum+=i;
          }
          return sum;
      }
  
      static long sum(long A[]) {
          long sum=0;
          for(long i : A) {
              sum+=i;
          }
          return sum;
      }
  
      static void print(int A[]) {
          for(int i : A) {
              System.out.print(i+" ");
          }
          System.out.println();
      }
  
      static void print(long A[]) {
          for(long i : A) {
              System.out.print(i+" ");
          }
          System.out.println();
      }
  
      static long mod(long x) {
            return ((x%mod + mod)%mod);
      }
  
      static long power(long x, long y)
      {
  
  	if(y==0)
  		return 1;
  	if(x==0)
  		return 0;
      long res = 1;
      while (y > 0) {
  
          if (y % 2 == 1)
              res = (res * x) ;
  
          y = y >> 1; 
          x = (x * x);
      }
  
      return res;
      }
  
      static boolean prime(int n) 
  	    { 
  	        if (n <= 1) 
  	            return false; 
  	        if (n <= 3) 
  	            return true; 
  	        if (n % 2 == 0 || n % 3 == 0) 
  	            return false; 
  	        double sq=Math.sqrt(n);
  	  
  	        for (int i = 5; i <= sq; i = i + 6) 
  	            if (n % i == 0 || n % (i + 2) == 0) 
  	                return false; 
  	        return true; 
  	    } 
  
       static boolean prime(long n) 
  	    { 
  	        if (n <= 1) 
  	            return false; 
  	        if (n <= 3) 
  	            return true; 
  	        if (n % 2 == 0 || n % 3 == 0) 
  	            return false; 
  	        double sq=Math.sqrt(n);
  	  
  	        for (int i = 5; i <= sq; i = i + 6) 
  	            if (n % i == 0 || n % (i + 2) == 0) 
  	                return false; 
  	        return true; 
  	    } 
  
      /************************** (for permutation of string )************************/
          // public static TreeSet<String>set=new TreeSet<>();
          // static void permute(String s , String answer)
          // {
          //     if (s.length() == 0)
          //     {
          //         set.add(answer);
          //         return ;
          //     }
              
          //     for(int i = 0 ;i < s.length(); i++)
          //     {
          //         char ch = s.charAt(i);
          //         String left_substr = s.substring(0, i);
          //         String right_substr = s.substring(i + 1);
          //         String rest = left_substr + right_substr;
          //         permute(rest, answer + ch);
          //     }
          // }
      /**************************************************************************/
  
      
  }