// #include <atcoder/modint>
// #include <atcoder/fenwicktree>
// #include <atcoder/lazysegtree>
// #include <atcoder/segtree>
// #include <atcoder/maxflow>
#include <atcoder/scc>
// #include <atcoder/mincostflow>
using namespace atcoder;

#include <bits/stdc++.h>
using namespace std;

constexpr long long INF_LL = 2000000000000000000LL;
constexpr int INF = 2000000000;
constexpr long long MOD = 998244353;
// constexpr long long MOD = 1000000007;

const double PI = acos(-1);

#define all(x) x.begin(), x.end()
#define REP(i, a, b) for(int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)

typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<ll> vl;

int dx[4] = {0, -1, 0, 1};
int dy[4] = {1, 0, -1, 0};
int sign[2] = {1, -1};

template <class T> bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}

ll modpow(ll a, ll b, ll m) {
    if(b == 0)
        return 1;
    ll t = modpow(a, b / 2, m);
    if(b & 1) {
        return (t * t % m) * a % m;
    } else {
        return t * t % m;
    }
}

template <class T>
T gcd(T m, T n) {
    if(n == 0) return m;
    return gcd(n, m % n);
}

struct edge {
    int to;
    ll cost;
    edge(int t, ll c) { to = t, cost = c; }
};

typedef vector<vector<edge>> graph;

// using mint = modint998244353;
// // using mint = modint1000000007;
// constexpr int MAX_COM = 1000001;
// mint fac[MAX_COM], ifac[MAX_COM];
// void initfac() {
//     fac[0] = ifac[0] = 1;
//     REP(i, 1, MAX_COM) fac[i] = i * fac[i - 1];
//     REP(i, 1, MAX_COM) ifac[i] = 1 / fac[i];
// }
// mint nCr(int n, int r){
//     if(r < 0 || n < r) return 0;
//     return fac[n] * ifac[n - r] * ifac[r];
// }


// typedef Matrix<double> S;
// S op(S x, S y){ return y * x; }
// S e(){ return Matrix<double>::I(3); }
// typedef int F;
// S mapping(F f, S x){ 
//     return f + x;
// }
// F composition(F f, F g){ 
//     return f + g;
// }
// F id(){ return 0; }

void solve(){
    int n;
    cin >> n;
    vi x(n), a(n);
    rep(i, n) cin >> x[i];
    rep(i, n) cin >> a[i];
    scc_graph scc(n);
    vector<vector<int>> g(n);
    rep(i, n){
        if(lower_bound(all(x), x[i] - a[i]) != upper_bound(all(x), x[i] - a[i])){
            scc.add_edge(i, lower_bound(all(x), x[i] - a[i]) - x.begin());
            g[i].push_back(lower_bound(all(x), x[i] - a[i]) - x.begin());
        }
        if(lower_bound(all(x), x[i] + a[i]) != upper_bound(all(x), x[i] + a[i])){
            scc.add_edge(i, lower_bound(all(x), x[i] + a[i]) - x.begin());
            g[i].push_back(lower_bound(all(x), x[i] + a[i]) - x.begin());
        }
    }
    auto vv = scc.scc();
    reverse(all(vv));
    vi res(n);
    rep(i, n) res[i] = x[i] + a[i];
    for(auto v : vv){
        int ma = 0;
        for(int x : v){
            for(int u : g[x]){
                chmax(res[x], res[u]);
            }
            chmax(ma, res[x]);
        }
        for(int x : v) res[x] = ma;
    }
    rep(i, n) cout << res[i] - x[i] << endl;
}

int main(){
    cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << std::fixed << std::setprecision(16);
    // initfac();
    int t;
    t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}