#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	
	int N;
	cin >> N;
	vector<ll> A(N), B(N);
	rep(i, 0, N) cin >> A[i];
	rep(i, 0, N) cin >> B[i];
	
	vector<ll> C(2*N);
	ll sumA = 0, sumB = 0;
	rep(i, 1, 2*N) {
		C[i] = C[i - 1];
		
		if (i <= N) {
			sumA += A[i - 1];
			sumB += B[i - 1];

		} else {
			sumA -= A[i - N - 1];
			sumB -= B[i - N - 1];
			C[i] -= (A[i - N - 1] + B[i - N - 1])*N; 
		}
		C[i] += sumA + sumB;
	}
	
	rep(i, 0, 2*N) cout << C[i] << (i == 2*N - 1 ? '\n' : ' ');
}