/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2022.05.21 00:12:42
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;


struct StronglyConnectedComponents {
private:
    vector<vector<int>> g, rg;
    vector<int> order; 
    vector<bool> visited;
    int V;

    void dfs(int v) {
        if (visited[v]) return;
        visited[v] = true;
        for (int u : g[v]) dfs(u);
        order.push_back(v);
    }

    void rdfs(int v, int c) {
        if (comp[v] != -1) return;
        comp[v] = c;
        for (int u : rg[v]) rdfs(u, c);
    }

public:
    vector<vector<int>> Graph; 
    vector<int> comp; 

    StronglyConnectedComponents(int v) : V(v) {
        g.resize(v);
        rg.resize(v);
        visited.resize(v);
        comp.resize(v);
    }
    
    void add_vertex(int n = 1) {
        V += n;
        g.resize(V);
        rg.resize(V);
        visited.resize(V);
        comp.resize(V);
    }

    void add_edge(int from, int to) {
        g[from].push_back(to);
        rg[to].push_back(from);
    }

    void build() {
        Graph = vector<vector<int>>();
        order = vector<int>();
        visited.assign(V, false);
        comp.assign(V, -1);
        for (int i = 0; i < V; i++) dfs(i);
        reverse(order.begin(), order.end());
        int number = 0;
        for (int i = 0; i < V; i++) {
            if (comp[order[i]] == -1) {
                rdfs(order[i], number++);
            }
        }
        Graph.resize(number);
        for (int i = 0; i < V; i++) {
            for (int v : g[i]) {
                if (comp[i] == comp[v]) continue;
                Graph[comp[i]].push_back(comp[v]);
            }
        }
    }
};

int main() {
    int n;cin >> n;
    vector<int> x(n);
    vector<int> a(n);
    StronglyConnectedComponents scc(n);
    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++) {
        auto t = lower_bound(x.begin(), x.end(), x[i]-a[i]);
        int k = t-x.begin();
        if (k < n && x[k] == x[i]-a[i]) {
            scc.add_edge(i,k);
            cerr << i << "->" << k << endl;
        }
        t = lower_bound(x.begin(), x.end(), x[i]+a[i]);
        k = t-x.begin();
        if (k < n && x[k] == x[i]+a[i]) {
            scc.add_edge(i,k);
            cerr << i << "->" << k << endl;
        }
    }
    scc.build();
    vector<int> dp(scc.Graph.size());
    for (int i = 0; i < n; i++) {
        dp[scc.comp[i]] = max(x[i]+a[i],dp[scc.comp[i]]);
    }
    for (int i = scc.Graph.size()-1; i >= 0; i--) {
        for (int u : scc.Graph[i]) {
            dp[i] = max(dp[i],dp[u]);
        }
    }
    for (int i = 0; i < n; i++) {
        cout << dp[scc.comp[i]] - x[i] << endl;
    }
    return 0;
}