OddEvenPositions

import java.util.Scanner;

public class OddEvenPositions {
    public static SLLNode<Integer> getEl(SLL<Integer> list, int index){
        SLLNode<Integer> tmp=list.getFirst();
        index--;
        while (index!=0){
            index--;
            tmp=tmp.succ;
            if(tmp==null)
                return null;
        }
        return tmp;
    }
    public static void transform(SLL<Integer> list){
        SLLNode<Integer> tmp=list.getFirst();
        SLLNode<Integer> ins;

        int n=2;
        ins=tmp;
        while (true){
            SLLNode<Integer> insert=getEl(list,n+1);
            if(insert==null){
                break;
            }
            list.insertAfter(insert.element,ins);
            ins=ins.succ;
            list.delete(insert);
            n+=2;
        }
        System.out.println(list);
    }
    public static void main(String[] args) {
        Scanner in=new Scanner(System.in);
        int n=in.nextInt();

        SLL<Integer> list=new SLL<>();
        for(int i=0;i<n;i++){
            list.insertLast(in.nextInt());
        }
        transform(list);
    }
}