import java.util.*;
import java.util.ArrayList;
public class Main{
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int m = input.nextInt();
ArrayList<Integer> list = new ArrayList<>();
for (int i = 0; i < m; i++) {
list.add(input.nextInt());
}
int n = input.nextInt();
for (int i = 0; i < n; i++) {
list.add(input.nextInt());
}
Collections.sort(list, new Comparator<Integer>() {
@Override
public int compare(Integer o1, Integer o2) {
return o2-o1;
}
});
for (Integer i : list) {
System.out.print(i+" ");
}
}
}
collections排序:默认为升序,如果需要降序重写comparator方法