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

void solve() {
    ll 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> acc(n+1, 0);
    rep(i, 0, n) acc[i+1] = acc[i] + a[i] + b[i];
    vector<ll> c(2*n, 0);
    rep(i, 0, n) c[i+1] = c[i] + acc[i+1];
    rep(i, n, 2*n-1) c[i+1] = c[i] + acc[n] - acc[i-n+1] - n * (a[i-n] + b[i-n]);
    rep(i, 0, 2*n) cout << c[i] << (i == 2*n-1 ? "\n" : " ");
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}