#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,n) for(int i = 0;i < (int)(n);i++)
#define RREP(i,n) for(int i = (int)n-1;i >= 0;i--)
#define FOR(i,s,n) for(int i = s;i < (int)n;i++)
#define RFOR(i,s,n) for(int i = (int)n-1;i >= s;i--)
#define ALL(a) a.begin(),a.end()
template<class T>inline bool CHMAX(T&a,T b){if(a<b){a = b;return true;}return false;}
template<class T>inline bool CHMIN(T&a,T b){if(a>b){a = b;return true;}return false;}
constexpr long long INF = 1e18;



signed main(){
	int N;
	cin>>N;
	vector<int>tapi(N,INF);
	REP(i,N){
		int t;
		cin >> t;
		CHMIN(tapi[i],t);
	}
	int end = INF;
	vector<int>y(N);
	REP(i,N){
		cin>>y[i];
		CHMIN(end,tapi[i]+y[i]);
	}
	REP(i,N){
		CHMIN(tapi[i],max(0ll,end-y[i]));
	}
	cout<<end<<endl;
	int add = max(0ll,-*min_element(ALL(tapi)));
	cout<<add<<endl;
	for(auto &e:tapi)cout << e+add << endl;
	cout<<end+add<<endl;
}