SP5609 KMOVES - Knight Moves

A knight is located at the (black) origin of an infinite chessboard. Let _f(n)_ define the number of black squares the knight can reach after making exactly _n_ moves. Given _n_ (0

The first line of the input contains a single integer T, the number of test cases (1

For each value of _n_ in the input, print a single line containing.