Perfect Shuffle

A perfect shuffle splits a deck exactly in half and then lays the cards down alternately from the two halves, starting with the top half.

Given a deck of cards, perform one perfect shuffle. If the number of cards is odd, the top half gets one more card than the bottom half.

The input holds several test cases. Each test case begins with a line containing one integer $n$, the number of cards ($1 \le n \le 1000$). Each of the next $n$ lines holds the name of a card, listed from the top of the deck down. A name is 1 to 80 characters long and contains only capital letters and dashes. Within one test case all card names are different. The input ends with a line containing a single 0.

For each test case, print $n$ lines holding the deck after one perfect shuffle. Print no extra spaces, and print no blank line between test cases.