/*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> lpair;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll N;
	cin >> N;
	ll X[200010], Y[200010];
	rep(i,0,N) cin >> X[i];
	rep(i,0,N) cin >> Y[i];
	ll ans = INF;
	rep(i,0,N){
		ans = min(ans, X[i]+Y[i]);
	}
	print(ans);
	print(0);
	rep(i,0,N){
		if(X[i] > ans){
			print(ans);
		}else{
			print(X[i]);
		}
	}
	print(ans);

	

}