#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

std::vector<std::vector<int>> scc_dag(std::vector<std::vector<int>>& scc, std::vector<std::vector<int>>& graph) {
    int n = graph.size();
    int m = scc.size();
    std::vector<int> d(n);
    for(int i = 0; i < m; ++i) for(int v: scc[i]) d[v] = i;
    std::vector<std::vector<int>> to(m);
    std::vector<int> added(m, -1);
    for(int i = 0; i < m; ++i) {
        added[i] = i;
        for(int u: scc[i]) for(int x: graph[u]) {
            int v = d[x];
            if (added[v] != i) {
                added[v] = i;
                to[i].push_back(v);
            }
        }
    }
    return to;
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI x(n), a(n);
  rep(i, n) cin >> x[i];
  rep(i, n) cin >> a[i];
  VVI to(n);
  scc_graph g(n);
  rep(i, n) {
    int li = lower_bound(all(x), x[i] - a[i]) - x.begin();
    if (x[li] == x[i] - a[i]) {
      to[i].emplace_back(li);
      g.add_edge(i, li);
    }
    int ri = lower_bound(all(x), x[i] + a[i]) - x.begin();
    if (ri < n && x[ri] == x[i] + a[i]) {
      to[i].emplace_back(ri);
      g.add_edge(i, ri);
    }
  }
  auto scc = g.scc();
  auto to2 = scc_dag(scc, to);
  const int m = scc.size();
  constexpr int INF = 1001001001;
  VI dp(m, -INF);
  VI ans(n);
  rrep(i, m) {
    for(int j: to2[i]) chmax(dp[i], dp[j]);
    for(int v: scc[i]) chmax(dp[i], x[v] + a[v]);
    for(int v: scc[i]) ans[v] = dp[i] - x[v];
  }
  rep(i, n) cout << ans[i] << '\n';
}