Given 'N' unique characters (in infinite supply), find the number of possible mapped strings (P) of length 'N'. A Mapped string is one that follows following properties:
a. Both the left and right halves of the string contains unique characters.
b. Both the left and right halves of the string contains same characters.
For example: “abccba” is Mapped string since the left half(“abc”) do contain the same characters as the right half( “cba” ).
The first line contains an integer 'T' denoting the number of testcases. Then 'T' test cases follows. Each test case consists of a single line containing a single integer 'N' denoting the number of unique characters.
For each testcase print P modulo 1000000007. (Since the answer could be large so print it modulo 1000000007).
1 <= T <= 200
2 <=N <= 10^6
N is always even.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.