#include <bits/stdc++.h>
using namespace std;
int a[100003], b[100003], f[100003], g[100003], l[100003], p[100003], v[100003],
    ans[100003], n, m, x, ok;
void get(int i, int k, int &x) {
  int o = lower_bound(b + 1, b + m + 1, k) - b - 1;
  v[o] = 1, x = ans[i] = b[o];
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &a[i]);
    f[i] = 2e9;
  }
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) scanf("%d", &b[i]);
  n++, a[n] = 2e9, f[n] = 2e9;
  sort(b + 1, b + m + 1);
  for (int i = 1; i <= n; ++i) {
    if (a[i] != -1) {
      int j = lower_bound(f + 1, f + n + 1, a[i]) - f - 1;
      l[i] = j + 1, p[i] = g[j], f[j + 1] = a[i], g[j + 1] = i;
    } else
      for (int j = n, o = m; o >= 1; --o) {
        while (f[j] >= b[o]) j--;
        f[j + 1] = b[o], g[j + 1] = i;
      }
  }
  for (int i = l[n], j = n, x = a[n]; i--;) {
    if (a[j] != -1) {
      if (a[p[j]] != -1)
        x = a[p[j]], j = p[j];
      else
        get(p[j], a[j], x), j = p[j];
    } else {
      ok = 0;
      for (int s = j - 1; s >= 1; --s)
        if (a[s] != -1 && l[s] == i && a[s] < x) {
          x = a[j = s], ok = 1;
          break;
        }
      if (ok != 0) continue;
      for (int s = j - 1; s >= 1; --s)
        if (a[s] == -1) {
          get(s, x, x), j = s;
          break;
        }
    }
  }
  for (int i = 1, j = 1; i <= n; ++i)
    if (ans[i] == 0) {
      if (a[i] == -1) {
        while (v[j]) j++;
        v[j] = 1, ans[i] = b[j];
      } else
        ans[i] = a[i];
    }
  for (int i = 1; i < n; i++) cout << ans[i] << " ";
  return 0;
}
