October 9 - BMTK Programming School, High League
We define the LEVEL of a triangle as in the following illustrative image:
You have to count all triangles in the biggest one (level n).
The first line contains the number of test cases t (t ≤ 10000). Each line contains an integer n (1 ≤ n ≤
106) which is the level of the triangle in that test case.
For each test case, you should write a separate line: the number of triangles in the biggest one (level n). All answers will fit within the range of a 64-bit integer.
3 1 2 3
1 5 13