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.

Pizza 1Pizza 2

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

Added by:Shuvo
Date:2019-11-18
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All

hide comments
2020-12-03 04:47:23 Rafail Loizou
fast cin/cout won't work use printf scanf... duh
2019-11-18 18:49:07
just reverse of CUTCAKE
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.