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
*n*th and last card turns out to be the*n*of Spades.

On the first line of the input is a single positive integer, telling the number of test cases to follow. Each case consists of one line containing the integer *n*.

提交代码