Herbert is a game in which you control a robot on an infinite two-dimensional grid. There are three commands available to you:</p>

• s: Go one square forward in the current direction. 
• l: Turn ninety degrees counterclockwise.
• r: Turn ninety degrees clockwise.

After playing this game for a while, you wonder how many squares you can reach within a certain number of moves. Write a program to calculate the answer to this question.

입력 형식

On the first line an integer t (1 ≤ t ≤ 100): the number of test cases. Then for each test case:

• One line with an integer n (0 ≤ n ≤ 1 000 000 000): the maximum number of moves.

출력 형식

For each test case:

• One line with the number of reachable squares.

예제 입력

4
0
1
2
3

예제 출력

1
2
5
11