#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;
//const bool debug = false;
#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; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<long long>x(n);
	rep(i, n) {
		long long a; cin >> a; x[i] = a;
	}
	rep(i, n) {
		long long a; cin >> a; x[i] += a;
	}
	vector<long long>ans(n * 2);
	long long p = 0;
	rep(i, 2 * n) {
		if (0 != i)ans[i] = ans[i - 1];
		if (i > n)ans[i] -= n * x[i - (n + 1)];
		ans[i] += p;
		if (i < n)p += x[i];
		else p -= x[i - n];
	}
	rep(i, n * 2) cout << ans[i] << " ";
	return 0;
}