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
cobra_laden:
20170106 12:48:28
long gave me 2 WAs ___


kg93999:
20170105 19:39:41
hint: https://www.youtube.com/watch?v=8be2n67ytqw 

shreyanshgeek:
20161227 15:01:16
A little knowledge about the concept of special series sum will let u do it easily!! 

spartax:
20161201 06:09:07
Good Problem 

tjain1999:
20161128 13:42:00
@Ashok Thanks you saved me. I was pretty annoyed so as to why I was getting the wrong answer. Btw I will check the limits in the future. 

pedro:
20161026 19:54:01
really liked the deriving part of formula... 

jjchai:
20161008 20:18:59
Beware of the type of variables you use. You are calculating something very big. If overflow happens you get wrong answer. 

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 ...

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 