// Arup Guha
// 11/2/2013
// Solution to 2013 South East Regional Division 2 Problem H: Perfect Shuffle!

import java.util.*;

public class shuffle {

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);
		int n = stdin.nextInt();

		// Go through each case.
		while (n != 0) {

			// Read deck.
			String[] deck = new String[n];
			for (int i=0; i<n; i++)
				deck[i] = stdin.next();

			// Here is the shuffle.
			for (int i=0; i<n/2; i++) {
				System.out.println(deck[i]);
				System.out.println(deck[i+(n+1)/2]);
			}

			// Odd case...
			if (n%2 == 1)
				System.out.println(deck[n/2]);

			n = stdin.nextInt();
		}

	}
}