Boredom buster (Easy)

Gillian is normally a very lively child. Most of the time she plays with her friends and tries to indulge in some mischief. But today is different. Today Gillian woke up with the flu, so she has to stay in bed, still and bored. To entertain her, her brother came up with the following game.

When Gillian has an integer $x$ greater than 1, she can split it into two positive integers $y$ and $z$ such that $x = y + z$. After performing this operation, her brother gives her $y \cdot z$ hazelnuts. However, not all pairs of $y, z$ are valid. There are some rules Gillian must comply with. These rules differ between the easy and hard subproblems, and they are listed in the problem specification section.

Numbers obtained from this operation can also be split. At the beginning of the game, Gillian starts with a single integer $n$. She performs a series of operations described above until she is left with $n$ copies of the number 1. What is the maximum number of hazelnuts she can win if she chooses her moves wisely?

For any $x > 1$ there is exactly one valid way of splitting:

• if $x$ is divisible by 3, then $y = x/3$ and $z = 2x/3$;
• if $x$ is divisible by 2 (but not by 3), then $y = z = x/2$;
• otherwise, $y = 1$ and $z = x - 1$.

The first line of the input contains an integer $t \le 1000$ specifying the number of test cases. Each test case is preceded by a blank line.

Each test case contains a single line with Gillian's initial integer $n > 1$. You may assume that $n \le 10^6$.

For each test case, output a single line with the maximum number of hazelnuts.