Question
Plus 2 or Minus 1
Sharad has a number X whose value is initially 0. In one move, he can do one of the following:
- Increment X by 2 i.e. X: = X + 2
- Decrement X by 1 i.e. X: = X − 1
He can perform at most Y moves. He wants to determine how many distinct values can X have after performing at most Y moves.
Input
The first line of input will contain a single integer T, denoting the number of test cases.
The first and only line of each test case contains an integer Y - the maximum number of moves Sharad can perform.
Constraints
1 ≤ T ≤ 1000
0 ≤ Y ≤ 106
The first and only line of each test case contains an integer Y - the maximum number of moves Sharad can perform.
Constraints
1 ≤ T ≤ 1000
0 ≤ Y ≤ 106
Output
For each test case, output the number of distinct values X can have after performing at most Y moves.
Example
Input
2
0
1
Output
1
3
Explanation
Test case 1: Sharad can not perform any moves. Therefore final value of X is 0.
Test case 2: Sharad can perform at most 1 move. Therefore the final value of X can be -1, 0, 2.
2
0
1
Output
1
3
Explanation
Test case 1: Sharad can not perform any moves. Therefore final value of X is 0.
Test case 2: Sharad can perform at most 1 move. Therefore the final value of X can be -1, 0, 2.