#include<stdio.h>
#include<stdlin.h>
struct Node{
    int data;
    struct Node *prev;
    struct Node *next;
};
struct Node* insertion(struct Node *head,int value){
    struct Node* newnode=(struct Node*)malloc (sizeof(sruct Node));
    newnode->data=value;
    newnode->prev=NULL;
    newnode->next=NULL;
    if(head=NULL){
        return newnode;
        
    }
    struct Node *temp=head;
    while(temp->next !=NULL){
    temp=temp->next;
}
temp->next=newnode;
newnode->prev=temp;
return head;
}
void traverse(struct Node *head){
    struct Node*temp = head;
    while(temp!=NULL){
        printf("%d",temp->data);
        temp=temp->next;
    }
}
int main() {
    int size,value,itr;
    scanf("%d",&size);
    if(size<0){
        printf("Invalid input");
        return 0;
    }
    for(itr=0;itr<size;itr++){
        scanf("%d",&value);
       head=insertnode(head,value);
    }
    traverse(head);
    return 0;
    
}