{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"Given is an ordered deck of n cards numbered 1 to n with card 1 at the top and card n at the bottom. The following operation is performed as long as there are at least two cards in the deck:\n\nThrow away the top card and move the card that is now on the top of the deck to the bottom of the deck.\n\nYour task is to find the sequence of discarded cards and the last, remaining card.\n\nEach line of input (except the last) contains a number n ≤ 50. The last line contains 0 and this line should not be processed. For each number from the input produce two lines of output. The first line presents the sequence of discarded cards, the second line reports the last remaining card. No line will have leading or trailing spaces. See the sample for the expected format."}},{"title":"Sample input","value":{"format":"MD","content":"7\n19\n10\n6\n0"}},{"title":"Output","value":{"format":"MD","content":"Discarded cards: 1, 3, 5, 7, 4, 2\nRemaining card: 6\nDiscarded cards: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 4, 8, 12, 16, 2, 10, 18, 14\nRemaining card: 6\nDiscarded cards: 1, 3, 5, 7, 9, 2, 6, 10, 8\nRemaining card: 4\nDiscarded cards: 1, 3, 5, 2, 6\nRemaining card: 4\n"}},{"title":"","value":{"format":"MD","content":"Folklore, adapted by Piotr Rudnicki"}}]}