#line 1 "main.cpp"
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
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;
}
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;

using ll = long long;
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define REP1(i, n) for(int i = 0; i < int(n); i++)
#define REP2(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) ((int)(v).size())
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
constexpr int MOD2 = 998244353;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

void Case(int i) { cout << "Case #" << i << ": "; }
int popcount(int x) { return __builtin_popcount(x); }
ll popcount(ll x) { return __builtin_popcountll(x); }
#pragma endregion Macros

#line 1 "/Users/siro53/kyo-pro/compro_library/graph/scc.hpp"
// グラフを構築したらbuild()を必ず呼ぶこと!!!
class SCC {
  private:
    vector<vector<int>> G;
    vector<vector<int>> revG;
    vector<int> vs, comp;
    vector<bool> seen;
    int cnt;
    void dfs(int v) {
        seen[v] = true;
        for(const int &u : G[v]) {
            if(!seen[u]) { dfs(u); }
        }
        vs.emplace_back(v);
    }
    void rev_dfs(int v, int id) {
        seen[v] = true;
        comp[v] = id;
        for(const int &u : revG[v]) {
            if(comp[u] == -1) { rev_dfs(u, id); }
        }
    }

  public:
    SCC(int N) : G(N), revG(N), comp(N, -1), seen(N, false) {}
    SCC(vector<vector<int>> g)
        : G(g), revG(g.size()), comp(g.size(), -1), seen(g.size(), false) {
        int n = (int)g.size();
        for(int i = 0; i < n; i++) {
            for(const auto &u : g[i]) { revG[u].emplace_back(i); }
        }
    }
    void add_edge(int i, int j) {
        G[i].emplace_back(j);
        revG[j].emplace_back(i);
    }
    void build() {
        int n = (int)G.size();
        for(int i = 0; i < n; i++) {
            if(!seen[i]) dfs(i);
        }
        reverse(ALL(vs));
        cnt = 0;
        for(const int &v : vs) {
            if(comp[v] == -1) {
                rev_dfs(v, cnt);
                cnt++;
            }
        }
    }
    // 必ずbuild()した後に呼び出すこと!!!
    vector<vector<int>> get_contract_graph() {
        vector<vector<int>> res_g(cnt);
        for(int i = 0; i < int(G.size()); i++) {
            for(const int& to : G[i]) {
                int a = comp[i], b = comp[to];
                if(a == b) continue;
                res_g[a].push_back(b);
            }
        }
        return res_g;
    }
    int operator[](int k) const { return comp[k]; }
    int size() const { return cnt; }
};
#line 77 "main.cpp"

int main() {
    int N;
    cin >> N;
    vector<int> x(N), a(N);
    REP(i, N) cin >> x[i];
    REP(i, N) cin >> a[i];

    vector<vector<int>> G(N);
    REP(i, N) {
        auto it = lower_bound(ALL(x), x[i] - a[i]);
        int id = it - x.begin();
        if((*it) == x[i] - a[i]) {
            G[i].push_back(id);
        }
        it = lower_bound(ALL(x), x[i] + a[i]);
        id = it - x.begin();
        if((*it) == x[i] + a[i]) {
            G[i].push_back(id);
        }
    }
    // debug(G);

    SCC scc(G);
    scc.build();
    auto g = scc.get_contract_graph();
    // REP(i, N) debug(i, scc[i]);
    // debug(g);
    int sz = SZ(scc);
    vector<int> dp(sz, -INF);
    REP(i, N) chmax(dp[scc[i]], x[i] + a[i]);
    // debug(dp);
    for(int from = sz - 1; from >= 0; from--) {
        for(int to : g[from]) chmax(dp[from], dp[to]);
    }
    // debug(dp);

    REP(i, N) {
        int ans = dp[scc[i]] - x[i];
        cout << ans << '\n';
    }
}