#include <bits/stdc++.h>

using namespace std;
using ll = long long;

map<ll, ll> mp;
vector<ll> ans;
vector<bool> vst;
vector<vector<ll>> E;

template <typename T>
map<T, T> compress(vector<T> &A){

    map<T, T> comp;
    int N = A.size(), i=0;
    for (int i=0; i<N; i++) comp[A[i]];

    for (auto &e : comp){
        e.second = i;
        i++;
    }

    return comp;
}

void dfs(int from){
    vst[from] = 1;
    for (auto to : E[from]){
        if (vst[to]) continue;
        ans[to] = max(ans[to], ans[from]);
        dfs(to);
    }
}

int main(){

    ll N, M;
    cin >> N;
    vector<ll> X(N), A(N), v;
    for (int i=0; i<N; i++) cin >> X[i];
    for (int i=0; i<N; i++) cin >> A[i];
    for (int i=0; i<N; i++){
        v.push_back(X[i]);
        v.push_back(A[i]+X[i]);
        v.push_back(X[i]-A[i]);
    }
    map<ll, ll> mp = compress(v), rev;
    for (auto [x, y] : mp) rev[y] = x;
    M = mp.size();
    E.resize(M);
    ans.resize(M, -2e9);
    vst.resize(M);

    for (int i=0; i<M; i++) ans[i] = rev[i];

    for (int i=0; i<N; i++){
        E[mp[X[i]+A[i]]].push_back(mp[X[i]]);
        E[mp[X[i]-A[i]]].push_back(mp[X[i]]);
    }
    for (int i=M-1; i>=0; i--){
        if (!vst[i]) dfs(i);
    }

    for (int i=0; i<N; i++) cout << ans[mp[X[i]]] -X[i] << endl;

    return 0;
}