BETA

Difficulty Level: Easy

Submissions: 2367 Accuracy:

56.61%

Squares in N*N Chessboard

Find total number of Squares in a N*N cheesboard.

Input:

The first line contains an integer T, depicting total number of test cases. 
Then following T lines contains an integer N that is the side of the chessboard.


Output:

Each seperate line showing the maximum number of squares possible.


Constraints:

1 ≤ T ≤ 100
1 ≤ N ≤ 100

 

Example:

Input :

2
1
2

Output :

1
5

** For More Input/Output Examples Use 'Expected Output' option **

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.