#include<stdio.h>


using namespace std;

// Function to merge two sorted arrays into one sorted array
void mergeArrays(int* arr1, int n, int* arr2, int m, int* result) {
    int i = 0, j = 0, k = 0;
    while (i < n && j < m) {
        if (*(arr1 + i) < *(arr2 + j)) {
            *(result + k) = *(arr1 + i);
            i++;
        } else {
            *(result + k) = *(arr2 + j);
            j++;
        }
        k++;
    }
    while (i < n) {
        *(result + k) = *(arr1 + i);
        i++;
        k++;
    }
    while (j < m) {
        *(result + k) = *(arr2 + j);
        j++;
        k++;
    }
}

int main() {
    int n, m;
    cin >> n;
    int arr1[n];
    for (int i = 0; i < n; i++) cin >> arr1[i];
    cin >> m;
    int arr2[m];
    for (int i = 0; i < m; i++) cin >> arr2[i];

    if (n <= 0 || m <= 0) {
        cout << "Invalid input" << endl;
        return 0;
    }

    int* result = new int[n + m];
    mergeArrays(arr1, n, arr2, m, result);

    for (int i = 0; i < n + m; i++) {
        cout << *(result + i);
        if (i < n + m - 1) cout << "";
    }
    cout << endl;

    delete[] result;
    return 0;
}