sort

import java.util.Scanner;

public class SortiranjeDve {
    private static void transform(DLL<Integer> list1, DLL<Integer> list2) {
        DLLNode<Integer> tmp1=list1.getFirst();
        DLLNode<Integer> tmp2=list2.getFirst();

        while (tmp1!=null && tmp2!=null){
            if(tmp1.element<tmp2.element){
                while (tmp1!=null){
                    if(tmp1.element<tmp2.element){
                        tmp1=tmp1.succ;
                        if(tmp1.succ==null) break;
                    }else{
                        break;
                    }
                }
                 if(tmp1.succ==null){
                     if(tmp1.element>tmp2.element){
                         list1.insertBefore(tmp2.element,tmp1);
                     }
                     tmp1=tmp1.succ;
                     tmp2=tmp2.succ;
                 }else {
                     list1.insertBefore(tmp2.element, tmp1);
                     tmp2 = tmp2.succ;
                 }
            }
            else{
                list1.insertBefore(tmp2.element, tmp1);
                tmp1=tmp1.succ;
                tmp2=tmp2.succ;
            }

        }
        if(tmp2!=null && tmp1==null) {
            while (tmp2 != null) {
                list1.insertLast(tmp2.element);
                tmp2 = tmp2.succ;
            }
        }
        System.out.println(list1);
    }
    public static void main(String[] args) {
        Scanner in=new Scanner(System.in);
        int n=in.nextInt();

        DLL<Integer> list1=new DLL<>();
        for(int i=0;i<n;i++){
            list1.insertLast(in.nextInt());
        }

        int n2=in.nextInt();
        DLL<Integer> list2=new DLL<>();
        for(int i=0;i<n2;i++){
            list2.insertLast(in.nextInt());
        }
        transform(list1,list2);
    }
}