#include<stdio.h>
int top=-1,arr[20],size;
int isfull(){
    if(top==size-1)
        return 1;
    else
        return 0;    
}
void enqueue(int num){
    if(isfull()){
        printf("Stack overflow");
    }
    else
        arr[++top]=arr[num];
}
void dequeue(){
    int i;
    for(i=0;i<size/2;i++){
        printf("%d",arr[i]);
    }
   
}
void traverse(){
    int itr;
    for(itr=(size/2)+1;itr<=size;itr++){
        printf("%d",arr[itr]);
    }
}
int main(){
    int num;
    scanf("%d",&size);
    if(size<0){
        printf("Invalid input");
        return 0;
    }
    for(int i=0;i<size;i++){
        scanf("%d",&num);
        enqueuq(num);
    }
    dequeue(num);
    traverse();
    return 0;
}