一个经典纸牌游戏，第一次将一张纸牌从最上面移到最先面，从最上面抽一张放到桌子上，第二次两张，从最上面抽一张放到桌子上，第三次三张.......一次类推。使放到桌上的牌的顺序为1、2....n。求开始的顺序。-POJ 3032

The magician shuffles a small pack of cards, holds it face down and performs the following procedure:



　　The top card is moved to the bottom of the pack. The new top card is dealt face up onto the table. It is the Ace of Spades.

　　Two cards are moved one at a time from the top to the bottom. The next card is dealt face up onto the table. It is the Two of Spades.

　　Three cards are moved one at a time…

　　This goes on until the nth and last card turns out to be the n of Spades.

This impressive trick works if the magician knows how to arrange the cards beforehand (and knows how to give a false shuffle). Your program has to determine the initial order of the cards for a given number of cards, 1 ≤ n ≤ 13.