#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;

int main(){
  int N;
  cin>>N;
  vector<ll> X(N),Y(N);
  rep(i,N) cin>>X[i];
  rep(i,N) cin>>Y[i];

  ll mi=MOD;
  for(int i=0;i<N;i++) mi=min(mi,X[i]+Y[i]);

  cout<<mi<<endl;
  cout<<0<<endl;
  rep(i,N){
    if(X[i]>mi) cout<<mi<<endl;
    else cout<<X[i]<<endl;
  }
  cout<<mi<<endl;


  return 0;
}