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
Govind Lahoti:
20150208 14:12:17
nice problem :)


Abhishek pratap singh:
20141209 13:16:19
@ayushi for the 4 the level


ayushi agarwal:
20141106 19:23:09
how the answer for level 4 is 27?? Mine is coming 26?? 

Tizen:
20140630 14:48:17
@Priyam Mitra  For Level 3, there will be 9 small triangles, 3 medium triangles and 1 big triangle. 

candide:
20140525 00:11:52
By omitting the figure for the stage 3, problem statement is confusing and suggests that at each step, every triangle is divided into four triangles. As comments show, many spojer are confused, and some even believe that 13 is an erroneous response for the stage 3... So, to clarify : at stage N, the sides of the initial triangle are divided into N parts. And, indeed, 13 is the correct counting at stage 3. Last edit: 20140525 01:35:02 
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 