Tetrahedral Stacks of Cannonballs

WALL•ETM©, as he cleans up and organizes the depopulated Earth, has come upon some Civil War memorials. He is consolidating the cannonballs into one location, and decides to use pyramids with triangular bases rather than ones with square bases.

In Civil War memorials with cannons and stacks of cannonballs, the cannonballs were sometimes stacked as a four-sided pyramid, whose base is a square with $n$ cannonballs on each side. An alternative is to stack them as a three-sided pyramid, which is in fact one of the Platonic solids: a tetrahedron.

This tetrahedron of cannonballs has a base that is an equilateral triangle with $n$ cannonballs on each side. The number of balls in that triangle is simply the sum of the numbers from $1$ to $n$. On top of each layer (starting from the base) sits a triangle with one fewer ball on each side, up to the top-most layer, which is a single ball.

Given the number of cannonballs on each side of the base, compute the total number of cannonballs in the entire tetrahedral stack.

The first line contains a single number $n$, the number of tetrahedral problems posed (at most $100$). It is followed by exactly $n$ lines, each containing a single integer: the number of cannonballs on each side of the base of a tetrahedron. This value is greater than $0$ and less than $1000$.

For each problem, output on one line: the problem number (starting from $1$), a colon and a single blank, the number of cannonballs on each side of the base, one blank, and finally the total number of cannonballs in the tetrahedron.