Garginator is a very good chess player.
Recently he thought of introducing a new chess piece Camel.
If a camel is placed at position (X,Y) it can attack any piece present at position (X+1,Y),(X-1,Y),(X,Y+1) and (X,Y-1).
Now Garginator was wondering what maximum number of Camels he can place on a NxN chessboard so that no pieces attack each other.

Input :

First line will contain an integer T (number of test cases)
Next T lines contain an integer N

Output :

Print the required answer for every N on a new line.

Constraints : 1<=T<=1000
1<=N<=100000