// editor4
#include<stdio.h>
#include<stdlib.h>
struct Node{
    int data;
    struct Node*prev;
    struct Node*next;
};
struct Node* createNode(int data)
{
    struct Node*newNode=(struct Node*)malloc(sizeof(struct Node));
    newNode->data=data;
    newNode->prev=newnode->next=NULL;
    return newNode;
}
void insertend(struct Node*head,int data)
{
    struct Node*newNode=createNode(data);
    if(head==NULL){
    return newNode;
    
    }
    struct Node*temp=head;
    while(temp->next!=NULL){ 
    temp=temp->next;
    }

    temp->next=newNode;
    newNode->prev=temp;
    return head;
}
struct Node*merge(struct Node*head1,struct Node*head2)
{
    if(!head1)return head2;
    if(!head2)return head1;
    struct node*result=NULL;
    if(head1->data<=head2->data){
        result=head1;
        result->next=merge(head1->next,head2);
        if(result->next) result->next->prev=result;
    }
    return result;
}
void printlist(struct Node*head)
{
    struct Node*temp=head;
    while(temp!=NULL)
    {
        printf("%d",temp->data);
        temp=temp->next;
    }
    printf("\n");
}
int main()
{
    int n1,n2,val;
    scanf("%d",&n1);
    if(n1<=0)
    {
        printf("Invalid input\n");
        return 0;
        
    }
    struct Node*head1=NULL;
    for(int i=0;i<n1;i++)
    {
        scanf("%d",&val);
        head1=insertend(head1,val);
}
scanf("%d",n2);
if(n2<=0)
{
    printf("Invalid input\n");
    return 0;
}
struct Node*head2=NULL;
for(int i=0;i<n2;i++)
{
    scanf("%d",&val);
    head2=insertend(head2,val);
    
}
struct Node mergedhead=mergelists(head1,head2);
printlist(mergedhead);
return 0;
}