#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> pp;
const int INF = 1e9;
const int MOD = 1000000007;


int main() {
    int n;
    cin >> n;
    vector<int> x(n),y(n);
    rep(i,n) cin >> x[i];
    rep(i,n) cin >> y[i];

    int ans = INF,idx = 0;

    rep(i,n){
        if(ans > x[i] + y[i]){
            idx = i; ans = x[i] + y[i];
        }
    }
    
    cout << ans << endl;
    rep(i,n+2){
        if(i == 0) cout << 0 << endl;
        else if(i == n+1) cout << ans << endl;
        else{
            if(x[i-1] < ans) cout << x[i-1] << endl;
            else cout << ans << endl;
        }
    }

    return 0;  
}