TRICOUNT  Counting Triangles
We define the LEVEL of a triangle as in the following illustrative image:
Task: Your task is very easy. All you have to do is to count all triangles in the biggest one (Level N).
Input
The first line of the input contains an integer T (T ≤ 10000)  the number of test cases and T lines follow. Each line contains an integer N (1 ≤ N ≤ 10^{6}) which is the level of the triangle in that test case.
Output
For each test case, you should write a seperate line: the number of triangles in the biggest one (Level N). (All answers will fit within the range of a 64bit integer)
Example
Input:
3
1
2
3
Output:
1
5
13
Source limit is 500 bytes.
hide comments
Ashok:
20160916 14:40:59
Java users use long,6 WA :( for that 

black_jack1:
20160915 21:56:10
Source Code limit is too low. Not fit for java!! 

cubalgo:
20160722 13:42:54
deriving the formula was fun ...


blitzzna:
20160620 16:47:14
what is level 3


bhushangawde:
20160514 17:27:08
tried a lot to derive the formula!! finally had to check the net :((( 

vector1996:
20160311 14:14:08
enjoyed a lot deriving formula ... i will recommend to derive it yourself rather than coping from net, else no point of doing this question 

ashu05:
20160207 14:00:39
damn good question.. =D


suvro_datta:
20160121 08:15:40
garmel really good 

shikhar_gupta_:
20151225 07:29:00
There is no diagram of level 3, it makes it difficult to understand what the pattern is. 

Timmy Jose:
20151211 20:39:54
And at all the people commenting about the formula online, the whole point is to figure out the formula yourself otherwise there's not much point, is there? Heh. 
Added by:  nha.duong 
Date:  20070805 
Time limit:  1s 
Source limit:  500B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 ERL JSRHINO NODEJS OBJC PERL6 SQLITE VB.NET 
Resource:  Trần Huy Hưng 