Given an integer N. Consider all the possible permutations \(p[\ ]\) of all integers from \(1\) to \(N\). Calculate the value of \(X\) for each permutation : 

\(X = \sum_{i = 1}^{i = N} N - p[i]\)

Determine the sum of all \(X\) for all possible permutations.

Input format

• First line: A single integer \(T\) denoting the number of test cases
• Second line: A single integer N.

Output format

 For each test case, print a single line containing the answer.

Constraints

\(1 \leq T \leq 5\)

\(1 \leq N \leq 10\)