#include<stdio.h>
#include<stdlib.h>
typedef struct node {
    int data;
    struct node *next,*prev;
}Node;
Node *head=NULL,*tail=NULL;
Node *create(int num) {
    Node *newnode=(Node*)malloc(sizeof(Node));
    newnode->data=num;
    newnode->next=NULL;
    newnode->prev=NULL;
    if(head==NULL) {
        head=newnode;
        tail=newnode;
    else{
        newnode->next=prev;
        tail->next=newnode;
        tail=newnode;
    }
}
void *display() {
    Node* itr;
    for(itr=head;itr!=NULL;itr++) {
        printf("%d",itr->data);
    }
}
void *delete(int val) {
    itr=head->next;
    if(head->data=val{
        head->head=next;
        head->next=val;
    }
    else if(tail->data=val){
        tail->next=val;
    
    }
    else {
        if(itr->data==val) {
            itr->next->prev=itr->prev;
            itr->prev->next=itr->next;
        }
        itr=itr->next;
    }
}
int main() {
    int size,num,itr,val;
    scanf("%d",&size);
    if(size<0) {
        printf("Node not found");
        return 0;
    }
    for(itr=1;itr<=size;itr++) {
        scanf("%d",&num);
     }
     for(itr=1;itr<=size;itr++) {
         scanf("%d",&val);
     }
     display();
    create (num);
    return 0;
}
}