import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int[] solve(const(int) N, const(int[]) X, const(int[]) Z) {
  auto xs = X.dup, zs = Z.dup;
  int m = N;
  alias Entry = Tuple!(int, "z", int, "y");
  BinaryHeap!(Array!Entry) que;
  foreach (y; 0 .. N) {
    que.insert(Entry(zs[y], y));
  }
  for (; !que.empty; ) {
    const y = que.front.y;
    que.removeFront;
    if (!que.empty && que.front.z == zs[y]) {
      return [];
    }
    if (xs[y] == 0) {
      --m;
    } else {
      xs[y] -= 1;
      zs[y] -= m;
      que.insert(Entry(zs[y], y));
    }
  }
  
  foreach (y; 0 .. N) {
    if (zs[y] < 0) {
      return [];
    }
  }
  if (zs.minElement != 0) {
    return [];
  }
  
  return zs;
}

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto X = new int[N]; foreach (y; 0 .. N) X[y] = readInt;
      auto Z = new int[N]; foreach (y; 0 .. N) Z[y] = readInt;
      
      const ans = solve(N, X, Z);
      if (ans) {
        foreach (y; 0 .. N) {
          if (y) write(" ");
          write(ans[y]);
        }
        writeln;
      } else {
        writeln(-1);
      }
    }
  } catch (EOFException e) {
  }
}