#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;

template<class V, int ME> class BIT {
public:
	V bit[1<<ME];
	V operator()(int e) {if(e<0) return 0;V s=0;e++;while(e) s+=bit[e-1],e-=e&-e; return s;}
	void add(int e,V v) { e++; while(e<=1<<ME) bit[e-1]+=v,e+=e&-e;}
};
BIT<int,20> Am,Bm;
template<class V, int ME> class BIT_r {
public:
	V bit[2][1<<ME];
	BIT_r(){clear();};
	void clear() {ZERO(bit);};
	
	void update(int entry, V val0, V val1) {
		entry++;
		while(entry <= 1<<ME) bit[0][entry-1]+=val0, bit[1][entry-1] += val1, entry += entry & -entry;
	}
	V total(int entry) {
		if(entry<0) return 0;
		int e=entry++;
		V v0=0,v1=0;
		while(entry>0) v0+=bit[0][entry-1], v1+=bit[1][entry-1], entry -= entry & -entry;
		return e*v0+v1;
	}
	void add(int L, int R, V val) { // add val to L<=x<=R
		update(L,val,-val*(L-1));
		update(R+1,-val,val*R);
	}
	int lower_bound(V val) { //単調増加の時のみ使える
		V v0=0,v1=0; int i,ent=0;
		for(i=ME-1;i>=0;i--) {
			if((ent+(1<<i)-1)*(v0+bit[0][ent+(1<<i)-1])+(v1+bit[1][ent+(1<<i)-1])<val) {
				v0+=bit[0][ent+(1<<i)-1];
				v1+=bit[1][ent+(1<<i)-1];
				ent+=(1<<i);
			}
		}
		return ent;
	}
};
BIT_r<ll,20> As,Bs;
int A[202020],B[202020];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	vector<pair<int,int>> Ac={{-1,-1}},Bc={{-1,-1}};
	
	FOR(i,N) cin>>A[i];
	FOR(i,N) cin>>B[i];
	FOR(i,N) {
		Am.add(i,A[i]);
		Bm.add(i,B[i]);
		if(i) {
			Am.add(i,-Am(i-1));
			Bm.add(i,-Bm(i-1));
		}
		As.add(i,i,A[i]);
		Bs.add(i,i,B[i]);
		Ac.push_back({A[i],i});
		Bc.push_back({B[i],i});
		while(Ac[Ac.size()-2].first>Ac[Ac.size()-1].first) {
			int d=Ac[Ac.size()-2].first-Ac[Ac.size()-1].first;
			Am.add(Ac[Ac.size()-2].second,-d);
			Am.add(Ac[Ac.size()-1].second,d);
			As.add(Ac[Ac.size()-2].second,Ac[Ac.size()-1].second-1,-d);
			Ac[Ac.size()-2].first=Ac[Ac.size()-1].first;
			Ac.pop_back();
		}
		while(Bc[Bc.size()-2].first>Bc[Bc.size()-1].first) {
			int d=Bc[Bc.size()-2].first-Bc[Bc.size()-1].first;
			Bm.add(Bc[Bc.size()-2].second,-d);
			Bm.add(Bc[Bc.size()-1].second,d);
			Bs.add(Bc[Bc.size()-2].second,Bc[Bc.size()-1].second-1,-d);
			Bc[Bc.size()-2].first=Bc[Bc.size()-1].first;
			Bc.pop_back();
		}
		int len=0;
		for(j=20;j>=0;j--) if(len+(1<<j)<=1+i&&Am(len+(1<<j)-1)<=Bm(i-(len+(1<<j)-1))) len+=1<<j;
		
		ll ret=As.total(len-1)+Bs.total(i+1-len-1);
		cout<<ret<<" ";
		
	}
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}