#include <bits/stdc++.h>
using namespace std;
int read() {
  int s = 0, t = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') t = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
  return s * t;
}
int f[200100], g[200100], a[200100], n, m, k, s[200100], l[200100], p[200100],
    ans[200100];
bool vis[200100];
void get(int i, int v, int &x) {
  int j = lower_bound(s + 1, s + m + 1, v) - s - 1;
  vis[j] = 1;
  x = ans[i] = s[j];
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++)
    a[i] = read(), k += a[i] == -1, f[i] = 2002122500;
  ++n;
  f[n] = a[n] = 2002122500;
  m = read();
  for (int i = 1; i <= m; i++) s[i] = read();
  sort(s + 1, s + m + 1);
  for (int i = 1; i <= n; i++) {
    if (a[i] == -1) {
      for (int j = n, w = m; w; w--) {
        while (f[j] >= s[w]) j--;
        f[j + 1] = s[w], g[j + 1] = i;
      }
    } else {
      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;
    }
  }
  int x = a[n];
  for (int i = l[n] - 1, j = n, w; ~i; i--) {
    if (~a[j]) {
      if (a[p[j]] == -1)
        get(p[j], a[j], x);
      else
        x = a[p[j]];
      j = p[j];
    } else {
      for (w = j - 1; w; w--)
        if (~a[w] && l[w] == i && a[w] < x) {
          x = a[j = w];
          break;
        }
      if (w) continue;
      for (w = j - 1; w; w--)
        if (!~a[w]) {
          get(w, x, x), j = w;
          break;
        }
    }
  }
  for (int i = 1, j = 1; i <= n; i++)
    if (~a[i])
      ans[i] = a[i];
    else if (!ans[i]) {
      while (vis[j]) j++;
      ans[i] = s[j];
      j++;
    }
  for (int i = 1; i < n; i++) printf("%d ", ans[i]);
  return 0;
}
