#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);
    vector<ll> X(N), A(N);
    map<ll, int> m;
    rep(i, N) {
        cin >> X[i];
        m[X[i]] = i;
    }
    rep(i, N) cin >> A[i];
    rep(i, N) {
        auto d0 = X[i] + A[i];
        if(m.find(d0) != m.end()) {
            g[i].push_back(m[d0]);
            g[m[d0]].push_back(i);
        }

        auto d1 = X[i] - A[i];
        if(m.find(d1) != m.end()) {
            g[i].push_back(m[d1]);
            g[m[d1]].push_back(i);
        }
    }

    vector<bool> done(N);
    function<ll(int)> f = [&](int x) -> ll {
        if(done[x]) return 0;
        done[x] = true;
        auto ans = X[x] + A[x];
        for(auto nx : g[x]) {
            ans = max(ans, f(nx));
        }
        return ans;
    };

    vector<bool> done2(N);
    vector<ll> ans(N);
    function<void(int, ll)> f2 = [&](int x, ll d) {
        if(done2[x]) return;
        done2[x] = true;
        ans[x] = d;
        for(auto nx : g[x]) {
            f2(nx, d);
        }
    };

    rep(i, N) {
        if(done[i]) continue;
        auto d = f(i);
        f2(i, d);
    }

    rep(i, N) {
        auto a = ans[i] - X[i];
        cout << a << endl;
    }

    return 0;
}