#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;
    ll x[n], y[n];
    rep(i,n)cin >> x[i];
    rep(i,n)cin >> y[i];
    ll mi = 1001001001001001;
    rep(i,n){
        mi = min(mi, x[i]+y[i]);
    }

    cout << mi << endl;
    cout << '0' << endl;
    rep(i,n){
        cout << min(x[i], mi) << endl;
    }
    cout << mi << endl;

    return 0;
}