#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#include <numeric>
#include <iomanip> 
#include <stdio.h>
#include <assert.h>
#include <cstring>
//eolibraries
#define lnf 3999999999999999999
#define inf 999999999
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define all(c) (c).begin(),(c).end()
#define sz(c) (int)(c).size()
#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())
#define pii pair <int,int>
#define tpii pair<pii,int>
#define rep(i,n) for(int i = 0 ; i < n ; i++) 
#define drep(i,n) for(int i = n-1 ; i >= 0 ; i--)
#define crep(i,x,n) for(int i = x ; i < n ; i++)
#define vi vector <int> 
#define vec(...) vector<__VA_ARGS__>
#define fcin ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
//eodefine
using namespace std;

const int mxn=302;

int main(){
fcin;
	int n;
	cin>>n;
	vec(ll) a(n),b(n);
	rep(i,n) cin>>a[i];
	rep(i,n) cin>>b[i];
	vec(ll) c(2*n),psum(n),psumb(n);
	rep(i,n){
		if(i) psum[i]=psum[i-1]+a[i];
		else psum[i]=a[i];
	}
	rep(i,n){
		if(i) psumb[i]=psumb[i-1]+b[i];
		else psumb[i]=b[i];		
	}
	vec(ll) nowa(2*n),nowb(2*n);
	cout<<"0 ";
	rep(i,2*n-1){
		nowa[i]=(i-1>=0?nowa[i-1]:0);
		if(i>=n){
			nowa[i] -= a[i-n]*n;
		}
		nowa[i]+=(i<n?psum[i]:psum[n-1]-psum[i-n]);

		nowb[i]=(i-1>=0?nowb[i-1]:0);
		if(i>=n){
			nowb[i] -= b[i-n]*n;
		}
		nowb[i]+=(i<n?psumb[i]:psumb[n-1]-psumb[i-n]);
		
		cout<<nowa[i]+nowb[i]<<" ";
	}

// 
	return 0;
}