#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;

//#define DISABLE_PRINT

#if defined(ENABLE_PRINT) && !defined(DISABLE_PRINT)

#define P(...) fprintf(stderr, __VA_ARGS__)
#define P2(fmt) fprintf(stderr, fmt)
#define LP fprintf(stderr, "L: %d\n", __LINE__)

#else

#define P(...) ((void)0)
#define P2(fmt) ((void)0)
#define LP ((void)0)

#endif

#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define ALL(x) x.begin(),x.end()

using ll = long long;
using ull = unsigned long long;

int main(int, const char**)
{
    int N; cin >> N;
    vector<vector<int>> g(N);
    map<int, pair<int, int>> m;

    struct D {
        int X;
        int A;
    };
    vector<D> ins(N); 
    rep(i, N) cin >> ins[i].X;
    rep(i, N) cin >> ins[i].A;
    rep(i, N) {
        m[ins[i].X] = {i, ins[i].A};
    }
    rep(i, N) {
        auto r = ins[i].X + ins[i].A;
        if(m.find(r) != m.end()) {
            g[i].push_back(m[r].first);
            g[m[r].first].push_back(i);
        }
        auto l = ins[i].X - ins[i].A;
        if(m.find(l) != m.end()) {
            g[i].push_back(m[l].first);
            g[m[l].first].push_back(i);
        }
    }

    vector<int> ans(N, -1);

    function<void(int x, int a)> f0 = [&](int x, int a) {
        if(ans[x] != -1) return;
        ans[x] = ins[a].X + ins[a].A - ins[x].X;
        for(auto nx : g[x]) {
            f0(nx, a);
        }
    };

    vector<bool> visit(N);
    function<int(int x)> f1 = [&](int x) {
        if(visit[x]) return x;
        visit[x] = true;
        int ans = x;
        int distMax = ins[x].X + ins[x].A;
        for(auto nx : g[x]) {
            auto ta = f1(nx);
            if(ins[ta].X + ins[ta].A > distMax) {
                distMax = ins[ta].X + ins[ta].A;
                ans = ta;
            }
        }
        return ans;
    };

    rep(i, N) {
        if(ans[i] != -1) continue;
        auto a = f1(i);
        f0(i, a);
    }

    rep(i, N) cout << ans[i] << endl;

    return 0;
}