#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=INF;
const ll MAX=1000010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;





signed main(){
    ll n;cin>>n;
    vector<ll>a(n),b(n);
    rep(i,n){
        cin>>a[i];
    }
    rep(i,n){
        cin>>b[i];
    }
    ll sa=0,sb=0;
    ll ssa=0,ssb=0;
    vector<ll>c(n*2);
    rep(i,n){
        sa+=a[i];
        ssa+=sa;
        sb+=b[i];
        ssb+=sb;
        c[i+1]=ssb+ssa;
    }
    REP(i,n,2*n-1){
        sa-=a[i-n];
        ssa-=a[i-n]*n;
        ssa+=sa;
        sb-=b[i-n];
        ssb-=b[i-n]*n;
        ssb+=sb;
        c[i+1]=ssb+ssa;
    }
    rep(i,2*n){
        cout<<c[i]<<' ';
    }
    cout<<endl;
}