#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()
#define dump(x) cout << #x << " = " << (x) << endl
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

template<class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; }
template<class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; }

template<class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
	os<<"{";
	rep(i, v.size()) {
		if (i) os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

int main() {
	int N; cin >> N;
	V<pii> vec(N);
	int mx = TEN(9);
	rep(i, N) {
		cin >> vec[i].fi;
	}
	rep(i, N) {
		cin >> vec[i].se;
	}
	rep(i, N) {
		chmin(mx, vec[i].fi + vec[i].se);
	}
	cout << mx << endl;
	V<int> pos(N + 2);
	pos[N + 1] = mx;
	rep(i, N + 2) {
		if (i > 0 && i < N + 1) {
			pos[i] = max(0, mx - vec[i-1].se);
		}
		cout << pos[i] << endl;
	}
	return 0;
}