#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vt = vector<T>;
template<class T> using vvt = vector<vt<T>>;
template<class T> using ttt = tuple<T,T>;
using tii = tuple<int,int>;
using tiii = tuple<int,int,int>;
using vi = vector<int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define mt make_tuple
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-8;
const ll DIV =1e9+7;
//const double PI = M_PI;
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;}
#define chmax(a,b) a=max(a,b)

/*Coding Space*/
ll x[1000000];
ll y[1000000];
int main(){
  int n; cin >> n; rep(i,n)cin >> x[i]; rep(i,n) cin >> y[i];

  ll ans = LLINF; rep(i,n) ans =min(ans, x[i] + y[i]);

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