### Bit Problem

Time Limit: 1000 ms Memory Limit: 65536 KiB

#### Problem Description

As everyone knows, any non-zero integer’s binary representation, must have at least one bit of the data 1, XiaoMing process whom wants to know if a binary representation of the rightmost 1 can change to 0, How much is this number will reduce.
But now, XiaoMing, busy job, no time to YY this question, so as ACMer your duty bound to help him solve this problem.

#### Input

Input consists of several cases, For each case, the first input is an integer N, then with N lines thar each integer is non zero integer. N=0 indicates the end of the input.

#### Output

For each set of case, we need to output N data corresponding to each row of data representation, the corresponding data in the most the 1 change 0, again resulting from the difference between the results with the original data. Each data finally output a blank line.

#### Sample Input

2
9
3

5
19999
456
10000000
1
8

0


#### Sample Output

Answer to case1:
1
1

8