#include <stdio.h>
#include <stdlib.h>

void sort(int *arr, int size) {
    
    for (int i = 0; i < size - 1; i++) {
        for (int j = 0; j < size - i - 1; j++) {
            if (*(arr + j) > *(arr + j + 1)) {
                int temp = *(arr + j);
                *(arr + j) = *(arr + j + 1);
                *(arr + j + 1) = temp;
            }
        }
    }
}

int main() {
    int n, m;
    scanf("%d", &n);
    if (n <= 0 || n > 10) {
        printf("Invalid input\n");
        return 0;
    }

    int arr1[10];
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr1[i]);
    }

    scanf("%d", &m);
    if (m <= 0 || m > 10) {
        printf("Invalid input\n");
        return 0;
    }

    int arr2[10];
    for (int i = 0; i < m; i++) {
        scanf("%d", &arr2[i]);
    }

    int merged[20];  /
    int *ptr = merged;

    for (int i = 0; i < n; i++) {
        *(ptr + i) = arr1[i];
    }
    for (int i = 0; i < m; i++) {
        *(ptr + n + i) = arr2[i];
    }

    sort(ptr, n + m);

    for (int i = 0; i < n + m; i++) {
        printf("%d ", *(ptr + i));
    }

    printf("\n");
    return 0;
}