There are cards such that for each , there are exactly one card labeled . Initially the cards are piled with increasing order from top to bottom. There are two operations:
- : One can take the top card of the pile and move it to the bottom;
- : One can remove the top card from the pile.
The operation is repeated until only one card gets left. Let be the labeled number on the final pile. Find all integers such that .