#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef pair<int,int> Paint;
int main(){
  int n;cin>>n;
  vector<int> a(n);
  vector<int> b(n);
  vector<Paint> sm;
  for(int i = 0; n > i; i++){
    cin>>a[i];
  }
  for(int i = 0; n > i; i++){
    cin>>b[i];
    sm.push_back({a[i]+b[i],i});
  }
  sort(sm.begin(),sm.end());
  vector<Paint> ans;
  for(int i = 0; n > i; i++){
    //0+a[sm[i].second]
    //sm[0].first-b[sm[i].second] ~ m[0].first+b[sm[i].second] 
    ans.push_back({sm[i].second,min(a[sm[i].second],sm[0].first+b[sm[i].second])});
  }
  sort(ans.begin(),ans.end());
  cout << sm[0].first << endl;
  cout << 0 << endl;
  for(int i = 0; n > i ;i++){
    cout << ans[i].second << endl;
  }
  cout << sm[0].first << endl;
}