#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main(){
  int N;
  cin >> N;
  //vector<ll int> zahyou(N+2);
  vector<int> X(N);
  vector<int> Y(N);
  int saishou, flag=0;
  int num=0;
  
  for(int i=0;i<N;i++){
    cin >> X.at(i);
  }
  for(int i=0;i<N;i++){
    cin >> Y.at(i);
  }
  
  saishou = X.at(0)+Y.at(0);
  for(int i=0;i<N;i++){
    saishou = min(saishou, X.at(i)+Y.at(i));
  }
  
  for(int i=0;i<N;i++){
    if(saishou==X.at(i)+Y.at(i)){
      num = i;
      break;
    }
  }
  
  cout << Y.at(num)+X.at(num) << endl;
  
  for(int i=0;i<N+2;i++){
    if(i==0){
      cout << 0 << endl;
    }
    else if(i==N+1){
      cout << Y.at(num)+X.at(num) << endl;
    }
    else{
      if(X.at(i-1)>Y.at(num)+X.at(num))
        cout << Y.at(num)+X.at(num) << endl;
      else
      	cout << X.at(i-1) << endl;
    }
  }  
  return 0;
}