Counting Triangles#4556

Counting Triangles

1 second
128 megabytes
Very easy

We define the level of a triangle as in the following illustrative image:

You have to count all possible triangles in the biggest one (level ).

Input

The first line contains the number of test cases (t \le 10000). Each line contains an integer (1 \le n \le 10^6) which is the level of the triangle in that test case.

Output

For each test case, you should write a separate line: the number of triangles in the biggest one (level ). All answers will fit within the range of a -bit integer.

Examples

Example 1

Loading
Loading