import java.util.*;

public class MergeAndSortArrays {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        // Read the first array
        int n = scanner.nextInt();
        Set<Integer> set = new TreeSet<>(); // Using TreeSet to store unique values in sorted order

        for (int i = 0; i < n; i++) {
            set.add(scanner.nextInt());
        }

        // Read the second array
        int m = scanner.nextInt();
        for (int i = 0; i < m; i++) {
            set.add(scanner.nextInt());
        }

        // Print the sorted union of the two arrays
        for (int num : set) {
            System.out.print(num + " ");
        }

        scanner.close();
    }
}