#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = a; i < b; i++)
#define rrep(i,a,b) for (int i = a - 1; i >= b; i--)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define pvec(a) for (int i = 0; i < a.size(); i++) cout << a[i] << " "; cout << '\n'
#define dbwt(a) cout << fixed << setprecision(15) << a << '\n'
using namespace std;
using ll = long long;
void wt() {cout << endl;}
template<class T, class U>bool chmin(T& a, U b) {if (a > b) {a = b; return 1;} return 0;}
template<class T, class U>bool chmax(T& a, U b) {if (a < b) {a = b; return 1;} return 0;}
template<class T, class U>long long llceil(T a, U b) {return (long long)(a + b - 1) / b;}
template<class H, class...T>void wt(H&& h, T&&... t){cout<<h<<" "; wt(forward<T>(t)...);}

//-------------------------------------------------------------------------------------//

int main() {
    int N;
    cin >> N;
    vector<ll> A(2*N+1, 0), B(2*N+1, 0);
    rep (i, 1, N+1) cin >> A[i];
    rep (i, 1, N+1) cin >> B[i];

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

    ll nsumA = A[1], nsumB = B[1];
    rep (k, 2, 2*N+1) {

        if (k >= N + 1) {
            

            C[k] = C[k-1] + nsumA + nsumB - (ll)(N+1)*A[k-N-1] - (ll)(N+1)*B[k-N-1];

            nsumA -= A[k-N-1];
            nsumB -= B[k-N-1];
        }
        else {
            C[k] = C[k-1] + nsumA + nsumB;
        }

        
        nsumA += A[k];
        nsumB += B[k];
        
        
    }
    
    rep (i, 1, 2*N+1) cout << C[i] << " "; cout << endl;
    return 0;
}