Given is an ordered deck of n cards num- bered 1 to n with card 1 at the top and card n at the bottom. The following op- eration is performed as long as there are at least two cards in the deck: Throw away the top card and move the card that is now on the top of the deck to the bot- tom of the deck. Your task is to find the last, remaining card. Input Each line of input (except the last) contains a positive number n ≤ 500000. The last line contains ‘0’ and this line should not be processed. Input will not contain more than 500000 lines. Output For each number from input produce one line of output giving the last remaining card. Sample Input 7 19 10 6 0 Sample Output 6 6 4 4