#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->next = head;
    newNode->perv = tail;
    head->prev = newNode;
    newNode = tail;

    Node *i=tail;
    do{
        printf("%d",i->data);
        i=i->prev;
    }while(i!=tail);
    
    
}
    
int main(){
    int size,val,iter;   
    if(scanf("%d",&size) != 1 || size<0){
        printf("Invalid input");
        return 0;
    }
    for(iter=0;iter<size;iter++){
        scanf("%d",&num);
        create(num);
    }
    scanf("%d",&val);
    insertion(val);
    return 0;
    
}