#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//const long nPrime = 1000000007;
//const long nPrime = 998244353;
typedef long long ll;
int main() {
    ll n;
    cin >> n;
    vector<ll> viX(n), viA(n), viCod(n,-1);
    vector<pair<ll,ll>> viReach(n);
    map<ll,ll> miX;
    vector<vector<ll>> vviCon(n);
    for(ll i = 0; i < n; i++){
        cin >> viX[i];
        miX.insert(make_pair(viX[i], i));
    }
    for(ll i = 0; i < n; i++){
        cin >> viA[i];
        viReach[i] = make_pair(viX[i]+viA[i],i);
        
        auto itr1 = miX.find(viX[i]+viA[i]);
        auto itr2 = miX.find(viX[i]-viA[i]);
        if(itr1 != miX.end()){
            ll iThis = itr1->second;
            vviCon[iThis].push_back(i);
        }
        if(itr2 != miX.end()){
            ll iThis = itr2->second;
            vviCon[iThis].push_back(i);
        }
    }
    sort(viReach.rbegin(), viReach.rend());
    
    for(ll i = 0; i < n; i++){
        ll iThis = viReach[i].second;
        if(viCod[iThis] > 0){
            continue;
        }
        ll iDist = viReach[i].first;
        viCod[iThis] = iDist;
        queue<ll> qiPoint;
        qiPoint.push(iThis);
        while(!qiPoint.empty()){
            ll x = qiPoint.front();
            qiPoint.pop();
            for(ll j = 0; j < vviCon[x].size(); j++){
                ll y = vviCon[x][j];
                if(viCod[y] > 0){
                    continue;
                }
                viCod[y] = iDist;
                qiPoint.push(y);
            }
        }
    }
    
    for(ll i = 0; i < n; i++){
        cout << viCod[i] - viX[i] << endl;
    }
    return 0;
}