Problem: 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

Solution (in PYTHON):

Solution:
import math
f = math.factorial
t = int(input())
for i in range(t):
	n = int(input())
	tp = 4*n
	total = (tp * (tp-1) * (tp-2))/f(3)
	ecp = 4*((n*(n-1)*(n-2))/f(3))
	print(int(total-ecp))