SPOJ Problems

[Angga Kasi Saini]

Can you help me to solve this problem ::

5874. Square
Problem code: SQRE

You are given a square with 'n' points on each side of the square. None of these points co-incide with the corners of this square. You have to compute the total number of triangles that can be formed using these '4n' points (n points on each side of the square) as vertices of the triangle.
Input

First line contains the integer 'T', the number of test cases. This is followed by 'T' lines with a single integer 'n' on each line n <= 100.
Output

The total number of triangles that can be formed.
Example


Input:
1
1

Output:
4

[hamsterman]

From 4n points you can pick C³_4n triplets, however not all of them form triangles.
A triplet does not form a triangle, if all points are in one row (on one side). There are 4*C³_n cases like that.
I think..