#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>
#include<ctime>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
//#define MOD 1000000007
#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
#define PI acos(-1.0)

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
//using mint = modint998244353;

int dh[] = {1,0,-1,0};
int dw[] = {0,1,0,-1};

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> suma(n+1),sumb(n+1),suma2(n+1),sumb2(n+1);
    rep(i,n){
        suma[i+1] = suma[i]+a[i];
        sumb[i+1] = sumb[i]+b[i];
        suma2[i+1] = suma2[i]+(i+1)*a[i];
        sumb2[i+1] = sumb2[i]+(i+1)*b[i];
    }
    rep(i,2*n){
        ll c = (suma[min(n,i)]-suma[max(0,i-n)])*(i+1)-(suma2[min(n,i)]-suma2[max(0,i-n)]);
        c += (sumb[min(n,i)]-sumb[max(0,i-n)])*(i+1)-(sumb2[min(n,i)]-sumb2[max(0,i-n)]);
        cout << c << " ";
    }
    cout << endl;
}