MOHIBPIZ  PIZZA
In this problem you are given a pizza.You have to find the maximum number of slices after cutting the pizza exactly N times.
Note that it is not necessary to make each slice equal.
For example if N = 1 then we can make maximum 2 slices. Figure 1 show this.
If N = 2 then we can make maximum 4 slices. Figure 2 show this.
Input
Input starts with an integer T (1<=10^6), denoting the number of test cases.
Each case contains an integer N (1 ≤ N ≤ 10^9) denoting the number of times you can cut the pizza.
Output
For each case of input, output only one integer the maximum number of slices.
Example
Input:2
1
2
Output:2
4
hide comments
abhishekv18:
20191118 18:49:07
just reverse of CUTCAKE 

mohibur:
20191118 15:21:47
now you can submit 

agakhand_19:
20191118 13:49:08
where is submit button? 

Vipul Srivastava:
20191118 11:49:40
Submit button? 
Added by:  Shuvo 
Date:  20191118 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 