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].
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class A {
    private static final FastReader fs = new FastReader();
    private static final PrintWriter out = new PrintWriter(System.out);
    private static long m = 1_000_000_009;
    private static long p = 31;
    private static long mod = 1_000_000_007;
    private static long ool = 1_000_000_000_000_000_009l;
    private static int ooi = 1_000_000_009;

    private static void solve() {
        long n = fs.nextLong();
        long p2 = mPower(2, mod-2);
        long ans = p2;
        for(long i = 1; i <= 2*n; i++)
            ans = mul(ans, i);
        out.println(ans);
    }

    public static void main(String[] args) {
        Thread t = new Thread(null, null, "", 1 << 28) {
            public void run() {
                int test_case = 1;
                test_case = fs.nextInt();
                for (int cs = 1; cs <= test_case; cs++)
                    solve();
                out.close();
            }
        };
        t.start();
        try {
            t.join();
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
    }

    private 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;
        }

        int[] readintarray(int n) {
            int res[] = new int[n];
            for (int i = 0; i < n; i++)
                res[i] = nextInt();
            return res;
        }

        long[] readlongarray(int n) {
            long res[] = new long[n];
            for (int i = 0; i < n; i++)
                res[i] = nextLong();
            return res;
        }
    }

    private static int max(int... arg) {
        int length = arg.length;
        if(length == 0)
            throw null;
        int maxVal = arg[0];
        for(int i = 1; i < length; i++)
            maxVal = Math.max(maxVal, arg[i]);
        return maxVal;
    }

    private static int min(int... arg) {
        int length = arg.length;
        if(length == 0)
            throw null;
        int maxVal = arg[0];
        for(int i = 1; i < length; i++)
            maxVal = Math.min(maxVal, arg[i]);
        return maxVal;
    }

    private static long max(long... arg) {
        int length = arg.length;
        if(length == 0)
            throw null;
        long maxVal = arg[0];
        for(int i = 1; i < length; i++)
            maxVal = Math.max(maxVal, arg[i]);
        return maxVal;
    }

    private static long min(long... arg) {
        int length = arg.length;
        if(length == 0)
            throw null;
        long maxVal = arg[0];
        for(int i = 1; i < length; i++)
            maxVal = Math.min(maxVal, arg[i]);
        return maxVal;
    }

    private static int abs(int a) {
        return a >= 0 ? a : -a;
    }

    private static int abs(int a, int b) {
        return a-b >= 0 ? a-b : b-a;
    }

    private static long abs(long a) {
        return a >= 0 ? a : -a;
    }

    private static long abs(long a, long b) {
        return a-b >= 0 ? a-b : b-a;
    }

    private static int power(int base, int exponent) {
        int res = 1;
        while(exponent > 0) {
            if((exponent & 1) != 0)
                res *= base;
            exponent >>= 1;
            base *= base;
        }
        return res;
    }

    private static long power(long base, long exponent) {
        long res = 1;
        while(exponent > 0) {
            if((exponent & 1) != 0)
                res *= base;
            exponent >>= 1;
            base *= base;
        }
        return res;
    }

    private static long mPower(long base, long exponent) {
        long res = 1;
        base %= mod;
        while(exponent > 0) {
            if((exponent & 1) != 0)
                res = mul(res, base);
            exponent >>= 1;
            base = mul(base, base);
        }
        return res;
    }

    private static long mul(long a, long b) {
        return a*b % mod;
    }

    private static long add(long a, long b) {
        return (a+b) % mod;
    }

    private static long sub(long a, long b) {
        long res = (a - b) % mod;
        if(res < 0)
            res += mod;
        return res;
    }

    private static long xor(long n){
        long r = n % 4;
        if(r == 0)
            return n;
        else if(r == 1)
            return 1;
        else if(r == 2)
            return n+1;
        else
            return 0;
    }
}