#include <iostream>
using namespace std;
int a[1001], b[1001];
int main() {
    int n;
    cin >> n;
    int nr_pos = 0, nr_neg = 0;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        if (a[i] > 0) nr_pos++;
        else nr_neg++;
    }
    int m;
    cin >> m;
    for (int i = 1; i <= m; i++) cin >> b[i];
    sort(b+1, b+m+1); // sau bubble sort, orice merge
    for (int i = 1; i <= nr_neg; i++) cout << b[i] << ' ';
    for (int i = m; i > m-nr_pos; i--) cout << b[i] << ' ';
    return 0;
}