import java.io.*;
import java.util.*;
import java.awt.geom.*;

/**
 * Solution to Perfect Shuffle
 * 
 * @author vanb
 */
public class shuffle_vanb
{
    public Scanner sc;
    public PrintStream ps;
    
    /**
     * Driver.
     * @throws Exception
     */
    public void doit() throws Exception
    {
        sc = new Scanner( System.in ); //new File( "shuffle.judge" ) );
        ps = System.out; //new PrintStream( new FileOutputStream( "shuffle.solution" ) );
        
        String cards[] = new String[1000];
        
        for(;;)
        {
            int n = sc.nextInt();
            if( n==0 ) break;
            
            for( int i=0; i<n; i++ )
            {
                cards[i] = sc.next();
            }
            
            // Find the middle. That's where the bottom stack starts.
            //
            // If n is even it's just n/2. 
            // For example, if n=4, we want array indices 0 and 1 in the top stack, 2 and 3 in the bottom.
            // so mid = 2 = 4/2
            //
            // If n is odd, it's n/2+1, since we want the top stack to be larger.
            // If n=5, then we want 0,1,2 in the top stack and 3,4 in the bottom,
            // so mid = 3 = 5/2+1
            int mid = n/2 + n%2;
            
            for( int i=0; i<mid; i++ )
            {
                // Print a card from the top stack
                ps.println( cards[i] );
                
                // Print a card from the bottom stack, if there is one
                if( mid+i<n ) ps.println( cards[mid+i] );
            }
        }
    }
    
    /**
     * @param args
     */
    public static void main( String[] args ) throws Exception
    {
        new shuffle_vanb().doit();        
    }   
}