#include <iostream>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <tuple>
#include <bitset>
#include <map>
#include <queue>
#include <time.h>
#include <utility>
#include <numeric>
#include <deque>
#include <cassert>
#include <sstream>
#include <cctype>
#include <unordered_map>
#include <algorithm>
#include <chrono>
#define ll long long
#include <time.h>
#define mod % 998244353
#define rep(i,n) for(long long i = 0;i < n;i ++)
ll MAX = 5'000'000'000'000'000'000LL;
using namespace std;



int main(){
  ll n;
  cin >> n;
  vector<ll> x(n);
  vector<ll> a(n);
  rep(i,n)cin >> x[i];
  rep(i,n)cin >> a[i];
  map<ll,ll> mp;
  rep(i,n){
    mp[x[i]] = i+1;
  }
  vector<vector<ll>> v(n);
  rep(i,n){
    ll j = mp[x[i]+a[i]];
    if(j != 0){
      v[j-1].push_back(i);
    }
    j = 0;
    j = mp[x[i]-a[i]];
    if(j != 0){
      v[j-1].push_back(i);
    }
  }
  priority_queue<tuple<ll,ll>> q;
  rep(i,n){
    q.push(make_tuple((x[i]+a[i]),i));
  }
  vector<ll> ans(n,-100);
  rep(i,n){
    ll j = get<1>(q.top());
    q.pop();
    if(ans[j]>=x[j]+a[j])continue;
    ans[j] = x[j]+a[j];
    vector<ll> nex = v[j];
    while(not nex.empty()){
      ll k = nex.back();
      nex.pop_back();
      if(ans[k]>=ans[j])continue;
      ans[k] = ans[j];
      for(ll l:v[k]){
        nex.push_back(l);
      }
    }
  }
  rep(i,n)cout << ans[i]-x[i] << endl;
  
  return 0;
}