Sinoka Studies Graphics

Sinoka wants to render a model made of regular polygons by dividing each polygon into nonoverlapping triangles. Find the number of triangles needed for each polygon.

The input is given in the following format:

$T$ $\mathrm{case}_1$ $\mathrm{case}_2$ $\vdots$ $\mathrm{case}_T$

Each case is given in the following format:

$N$ $A_1\ A_2\ \cdots\ A_N$

$A_i$ is the number of vertices of the $i$-th regular polygon.

For each case, print the number of triangles for each polygon in input order, one per line.

• $1\leq T\leq100\,000$.
• $1\leq N\leq100\,000$.
• $3\leq A_i\leq10^9$.
• The sum of $N$ over all cases is at most $200\,000$.