A knight jumps around an infinite chessboard. The chessboard is an unexplored territory. In the spirit of explorers, whoever stands on a square for the first time claims the ownership of this square. The knight initially owns the square he stands, and jumps $N$ times before he gets bored.

Recall that a knight can jump in 8 directions. Each direction consists of two squares forward and then one squaure sidways.

After $N$ jumps, how many squares can possibly be claimed as territory of the knight? As $N$ can be really large, this becomes a nightmare to the knight who is not very good at math. Can you help to answer this question?

Recall that a knight can jump in 8 directions. Each direction consists of two squares forward and then one squaure sidways.

After $N$ jumps, how many squares can possibly be claimed as territory of the knight? As $N$ can be really large, this becomes a nightmare to the knight who is not very good at math. Can you help to answer this question?

The first line of the input gives the number of test cases, $T$. $T$ test cases follow.

Each test case contains only one number $N$, indicating how many times the knight jumps.

$1 \leq T \leq 10^5$

$0 \leq N \leq 10^9$

Each test case contains only one number $N$, indicating how many times the knight jumps.

$1 \leq T \leq 10^5$

$0 \leq N \leq 10^9$

提交代码