#include<stdio.h>
#include<stdlib.h>

typedef struct node{
    int data;
    struct node *prev;
    struct node *next;
}Node;

Node *head = NULL, *tail;

void create(int num){
    Node *newNode = (Node*) malloc (1 * sizeof(Node));
    newNode->data = num;
    newNode->prev = NULL;
    newNode->next = NULL;
    if(head == NULL){
        head = newNode;
        tail = newNode;
    }
    else{
        newNode->prev = tail;
        tail->next = newNode;
        tail = newNode;
    }
    tail->next = head;
    head->prev = tail;
}

void insertion(int val){
    Node *newNode = (Node*) malloc (1 * sizeof(Node));
    newNode->data = val;
    tail->next = newNode;
    newNode->prev = tail;
    tail = newNode;
    tail->next = head;
    
    Node *itr=tail;
    do{
        printf("%d",itr->data);
        itr=itr->prev;
    }while(itr != tail);
}

int main(){
    int size, itr, num, val;
    scanf("%d",&size);
    
    if(size<=0){
        printf("Invalid input");
        return 0;
    }
    
    for(itr=0;itr<size;itr++){
        scanf("%d",&num);
        create(num);
    }
    
    scanf("%d",&val);
    insertion(val);
    return 0;
    
}