#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define each(e, v) for (auto &e : v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const int MOD = 1000000007;
// const int MOD = 998244353;

int main() {
    int N;
    cin >> N;

    int MAX = 1000000;
    vector<ll> X(N), Y(N);
    rep(i, N) cin >> X[i];
    rep(i, N) cin >> Y[i];

    vector<ll> v(N);
    rep(i, N) v[i] = i + 1;

    vector<priority_queue<pli>> que(MAX + 1);
    vector<int> id(MAX + 1, -1);

    rep(i, N) {
        if (id[Y[i]] != -1) {
            cout << "-1\n";
            return 0;
        }
        id[Y[i]] = i;
        que[X[i]].emplace(Y[i], i);
    }

    vector<ll> ans(N, -1);
    int ptr = MAX;

    rep3(t, N, 1) {
        ll ma = -INF;
        int p = -1;
        for (int i = 0; i * t <= MAX; i++) {
            while (!empty(que[i])) {
                int j = que[i].top().second;
                if (ans[j] != -1 || X[j] != i) {
                    que[i].pop();
                    continue;
                }
                ll tmp = Y[j] - X[j] * t;
                if (chmax(ma, tmp)) p = j;
                break;
            }
        }

        // cout << p << ' ' << ma << '\n';

        if (ma < 0) {
            cout << "-1\n";
            return 0;
        }
        if (t == 1 && ma > 0) {
            cout << "-1\n";
            return 0;
        }

        rep3(i, ptr, ma + 1) {
            if (id[i] == -1) continue;
            int e = id[i];
            if (ans[e] != -1) continue;
            if (Y[e] > ma) {
                ll d = (Y[e] - ma + t - 1) / t;
                Y[e] -= t * d;
                X[e] -= d;
                if (X[e] < 0 || Y[e] < 0 || id[Y[e]] != -1) {
                    cout << "-1\n";
                    return 0;
                }
                id[Y[e]] = e;
                que[X[e]].emplace(Y[e], e);
            }
            id[i] = -1;
        }

        // print(X), print(Y);

        ans[p] = ma;
        ptr = ma;
    }

    print(ans);
}