#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001


int main() {
    
	int n;
	cin>>n;
	vector<long long> a(n),x(n);
	rep(i,n)cin>>x[i];
	rep(i,n)cin>>a[i];
	
	vector<long long> t = x;
	rep(i,n){
		t.push_back(x[i]+a[i]);
		t.push_back(x[i]-a[i]);
	}
	
	sort(t.begin(),t.end());
	t.erase(unique(t.begin(),t.end()),t.end());
	
	scc_graph S(t.size());
	
	vector<vector<int>> E(t.size());
	rep(i,n){
		int d0 = distance(t.begin(),lower_bound(t.begin(),t.end(),x[i]));
		int d1 = distance(t.begin(),lower_bound(t.begin(),t.end(),x[i]+a[i]));
		E[d0].push_back(d1);
		S.add_edge(d0,d1);
		d1 = distance(t.begin(),lower_bound(t.begin(),t.end(),x[i]-a[i]));
		E[d0].push_back(d1);
		S.add_edge(d0,d1);
	}
	
	auto s = S.scc();
	
	vector<int> pos(t.size());
	rep(i,s.size()){
		rep(j,s[i].size())pos[s[i][j]] = i;
	}
	
	vector<long long> dp(t.size(),-Inf);
	for(int i=s.size()-1;i>=0;i--){
		long long m = -Inf;
		rep(j,s[i].size()){
			m = max(m,t[s[i][j]]);
			rep(k,E[s[i][j]].size())m = max(m,dp[E[s[i][j]][k]]);
		}
		rep(j,s[i].size()){
			dp[s[i][j]] = m;
		}
	}
	rep(i,n){
		int d0 = distance(t.begin(),lower_bound(t.begin(),t.end(),x[i]));
		cout<<dp[d0] - x[i]<<endl;
	}
	
    return 0;
}