#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000000007;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }

signed main(void){
    int n; cin>>n;
    vector <int> a(n), b(n);
    rep(i,n) cin>>a[i];
    rep(i,n) cin>>b[i];
    int ma = INF;
    rep(i,n) ma = min(ma, a[i]+ b[i]);
    cout<<ma<<endl;
    for(int i=0;i<n+2;i++){
        if(i==0) cout<<0<<endl;
        else if(i==n+1) cout<<ma<<endl;
        else{
            //cout<<a[i-1]<<' '<<b[i-1]<<endl;
            int mi = min(a[i-1], b[i-1]);
            if(a[i-1] == mi){
                if(a[i-1] > ma) cout<<ma<<endl;
                else cout<<a[i-1]<<endl;
            }else{
                if(ma-mi < 0) cout<<0<<endl;
                else cout<<ma - mi<<endl;
            }
        }
    }
}