#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

int main() {
    //ios::sync_with_stdio(false); cin.tie(0);

    int n;
    cin>>n;

    vi x(n),y(n);
    REP(i,n) cin>>x[i];
    REP(i,n) cin>>y[i];

    int mx = 0;
    int mn = 10e6;
    int mnidx = 0;
    REP(i,n){
        if(mn > x[i]+y[i]){
            mn = x[i]+y[i];
            mnidx = i;
        }
    }

    cout << mn << endl;
    cout << "0" << endl;
    REP(i,n){
        int dist = 0;
        if(i==mnidx)
            dist = x[i];
        else if(x[i]>y[i]){
            dist = max(0, mn-y[i]);
        }else
            dist = x[i];

        cout << dist << endl;
    }
    cout << mn << endl;

    return 0;
}