#include<stdio.h>
#include<stdlib.h>
typedef struct node{
    int data;
    struct node *prev;
    struct node *next;
} s1;

s1 *head=NULL,*tail=NULL;

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

int arr[20];
void sort(){
    s1 *i,*j;
    
    for( i=head;i=!NULL;i=i->next){
        for(j=head->next;i!=NULL;j=j->next){
            if(i->data > j->data){
                arr[i]=i->data;
            }
        }
    }
}

void display(int *arr,int size,int size1){
    
    for(int i=0;i<=size+size1;i++){
        printf("%d ",arr[i]);
    }
}

int main(){
    int size,num,size1;
    scanf("%d",&size);
    if(size<=0){
        printf("Invalid input");
        return 0;
    }
    for(int i=1;i<=size;i++){
        if(!scanf("%d\n",&num)){
            printf("Invalid input");
            return 0;
        }
        create(num);
    }
    scanf("%d",&size1);
    for(int i=1;i<=size1;i++){
        if(!scanf("%d\n",&num)){
            printf("Invalid input");
            return 0;
        }
        create(num);
    }
    display(arr,size,size1);
    return 0;
}