#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
using mint = atcoder::modint998244353;
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,a,b) for (int i = a; i < b; i++)
#define rrep2(i,a,b) for (int i = a-1; i >= b; i--)
#define rep3(i,a,b,c) for (int i = a; i < b; i+=c)
#define rrep3(i,a,b,c) for (int i = a-1; i >= b; i-=c)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

int n,X[200010],A[200010];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n;
    atcoder::dsu uf(n);
    map<int,int>mp;
    rep(i,n){
        cin>>X[i];
        mp[X[i]]=i;
    }
    vector<pair<int,int>>vp;
    rep(i,n){
        cin>>A[i];
        vp.push_back(make_pair(A[i]+X[i],i));
        if(mp.count(X[i]-A[i]))uf.merge(i,mp[X[i]-A[i]]);
        if(mp.count(X[i]+A[i]))uf.merge(i,mp[X[i]+A[i]]);
    }
    sort(rall(vp));
    vector<bool>flag(n);
    vector<vector<int>>vv(n);
    rep(i,n){
        vv[uf.leader(i)].push_back(i);
    }
    vector<int>Ans(n);
    rep(i,n)Ans[i]=A[i];
    for(auto[c,x]:vp){
        int l=uf.leader(x);
        if(flag[l])continue;
        flag[uf.leader(x)]=true;
        vector<int>g=vv[l];
        for(auto i:g){
            chmax(Ans[i],A[x]+(X[x]-X[i]));
        }
    }
    rep(i,n)cout<<Ans[i]<<"\n";
}