#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}

int main(){
    int n; cin >> n;
    map<int, int> mp;
    vi x(n), a(n);
    rep(i, n){
        cin >> x[i]; mp[x[i]] = i;
    }
    vvi adj(n);
    scc_graph scc(n);
    rep(i, n){
        cin >> a[i];
        if(mp.count((x[i] + a[i]))){
            adj[i].push_back(mp[x[i] + a[i]]);
            scc.add_edge(i, mp[x[i] + a[i]]);
        }if(mp.count((x[i] - a[i]))){
            adj[i].push_back(mp[x[i] - a[i]]);
            scc.add_edge(i, mp[x[i] - a[i]]);
        }
    }
    vvi g = scc.scc();
    reverse(all(g));
    vi ans(n, -1);
    for(auto v : g){
        int b = 0;
        for(auto i : v){
            b = max(b, x[i] + a[i]);
            for(auto j : adj[i])b = max(b, ans[j]);
        }
        for(auto i : v)ans[i] = b;
    }rep(i, n)cout << ans[i] - x[i]<< endl;

    return 0;
}