#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

struct io_setup{
    io_setup(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

int main(){
    int N; cin >> N;

    vector<ll> A(N), B(N);

    rep(i, N) cin >> A[i];
    rep(i, N) cin >> B[i];

    vector<ll> SA(N+1, 0), SB(N+1, 0);
    rep(i, N) SA[i+1] = SA[i]+A[i], SB[i+1] = SB[i]+B[i];

    vector<ll> C(2*N+1);
    ll S = 0;

    rep2(i, 1, 2*N){
        C[i] = S;
        if(i <= N){
            S += SA[i]+SB[i];
        }
        else{
            S -= (A[i-N-1]+B[i-N-1])*N;
            S += (SA[N]-SA[i-N])+(SB[N]-SB[i-N]);
        }
    }

    rep2(i, 1, 2*N) cout << C[i] << (i == 2*N? '\n' : ' ');
}