#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;

using ll = long long;
const int INF = 1e9;
const ll inf = 1LL<<60;

void solve() {
  int n; cin >> n;
  vector<ll> x(n), a(n);
  vector<ll> ans(n);
  for (int i=0; i<n; i++) cin >> x[i];
  for (int i=0; i<n; i++) {
    cin >> a[i];
    ans[i] = a[i];
  }
  for (int i=n-1; i>=0; i--) {
    int cur = lower_bound(x.begin(), x.end(), a[i] + x[i]) - x.begin();
    if (cur < n && x[cur] == a[i]+x[i]) ans[i] += ans[cur];
  }
  for (int i=0; i<n; i++) {
    int cur = lower_bound(x.begin(), x.end(), x[i] - a[i]) - x.begin();
    if (x[cur] == x[i] - a[i]) ans[i] = max(ans[i], ans[cur] - (x[i] - x[cur]));
  }
  for (int i=0; i<n; i++) {
    cout << ans[i] << '\n';
  }
}

int main() {
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  // int t; cin >> t;
  /*while (t--)*/ solve();
}