#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll>
using Graph = vector<vector<int>>;

const ll mod = 998244353;

int main() {
    ll N; cin >> N;
    ll a[N],b[N];
    rep(i,N) cin >> a[i];
    rep(i,N) cin >> b[i];
    ll c[2*N];
    ll sa[N+1],sb[N+1]; sa[0] = 0; sb[0] = 0;
    rep(i,N){
        sa[i+1] = sa[i]+a[i];
        sb[i+1] = sb[i]+b[i];
    }
    ll fa = 0,fb = 0;
    rep(i,N+1){
        fa += sa[i]; fb += sb[i];
        c[i] = fa+fb;
    }
    rep(i,N-1){
        ll k = N+1+i;
        fa += sa[N]-sa[i+1]; fa -= N*a[i];
        fb += sb[N]-sb[i+1]; fb -= N*b[i];
        c[k] = fa+fb;
    }
    rep(i,2*N){
        cout << c[i] << " ";
    }
    cout << endl;
}