#include <iostream>
#include <vector>
using namespace std;
void merge(vector<int>a, vector<int> b, int m, int n, vector<int> c) {
    size_t i, j, k;
    i = 0;
    j =0;
k = 0;
while (i < n && j < m) {
if (a[i] < b[j]) {
c[k++] = a[i++];
} else {
c[k++] = b[j++];
}
}
while (i < n) {
c[k++] = a[i++];
}
while (j < m) {
c[k++] = b[j++];
}
for (size_t p = 0; i!= n; ++i) {
cout << c[p] << endl;
}
}


int main() {
    int n, m;
    cin >> n;
    vector<int> a, b;
    vector<int> c;
    for (int i = 0; i!= n; ++i) {
        int cur;
        cin >> cur;
        a.push_back(cur);
    }
    cin >> m;
    c.reserve(m+n);
    for (int i = 0; i!=m; ++i) {
        int cur;
        cin >> cur;
        b.push_back(cur);
    }
merge(a, b, m, n, c);
}