Codeforces Round 745 (Div. 2) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

combinatorics

math

number theory

*800

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. CQXYM Count Permutations

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputCQXYM 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 is to get the remainder. For example:

- $$$7 \mod 3=1$$$, because $$$7 = 3 \cdot 2 + 1$$$,
- $$$15 \mod 4=3$$$, because $$$15 = 4 \cdot 3 + 3$$$.

Input

The input consists of multiple test cases.

The first line contains an integer $$$t (t \geq 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 \leq n \leq 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 \geq 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].$$$

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/22/2024 06:21:26 (k1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|