#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
map<long long, int> Compless(const vector<long long> &v) {
	vector<long long>vv = v;
	sort(all(vv));
	vv.erase(unique(all(vv)), vv.end());
	map<long long, int>mp;
	rep(i, vv.size()) mp[vv[i]] = i;
	return mp;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<long long>x(n), a(n);
	rep(i, n)cin >> x[i];
	rep(i, n)cin >> a[i];
	set<long long>st;
	rep(i, n) {
		st.insert(x[i]);
		st.insert(x[i] + a[i]);
		if (x[i] >= a[i])st.insert(x[i] - a[i]);
	}
	vector<long long>v;
	for (auto e : st)v.push_back(e);
	sort(all(v));
	v.erase(unique(all(v)), v.end());
	auto mp = Compless(v);
	dsu uf(v.size());
	rep(i, n) {
		long long s = x[i];
		long long t = x[i] + a[i];
		long long u = x[i] - a[i];
		uf.merge(mp[s], mp[t]);
		if (u >= 0) {
			uf.merge(mp[s], mp[u]);
		}
	}
	map<int, long long>mp2;
	auto g = uf.groups();
	for (auto v : g) {
		long long mx = -1;
		rep(i, v.size()) {
			chmax(mx, v[i]);
		}
		mp2[uf.leader(v[0])] = mx;
	}
	rep(i, n) {
		long long dist = v[mp2[uf.leader(mp[x[i]])]];
		long long ans = dist - x[i];
		cout << ans << endl;
	}
	return 0;
}