#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

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

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using P = pair<int, int>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<int> x(n);
    map<int, int> indices;
    for(int i = 0; i < n; i++){
        cin >> x[i];
        indices[x[i]] = i;
    }
    vector<int> a(n);
    vector<vector<int>> g(n);
    for(int i = 0; i < n; i++){
        cin >> a[i];
        int l = x[i]-a[i];
        int r = x[i]+a[i];
        if(indices.count(l)){
            int j = indices[l];
            g[j].push_back(i);
        }
        if(indices.count(r)){
            int j = indices[r];
            g[j].push_back(i);
        }
    }
    vector<bool> ok(n);
    priority_queue<P> que;
    for(int i = 0; i < n; i++) que.push(P(x[i]+a[i], i));
    vector<int> ans(n);
    while(!que.empty()){
        auto [d, v] = que.top(); que.pop();
        if(ok[v]) continue;
        ans[v] = d;
        ok[v] = true;
        for(int to: g[v]){
            que.push(P(d, to));
        }
    }
    for(int i = 0; i < n; i++) cout << ans[i]-x[i] << endl;
}