#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> void chmin(T &a, const T &b) { a = min(a, b); }
template<typename T> void chmax(T &a, const T &b) { a = max(a, b); }
struct FastIO {FastIO() { cin.tie(0); ios::sync_with_stdio(0); }}fastiofastio;
#ifdef DEBUG_ 
#include "../program_contest_library/memo/dump.hpp"
#else
#define dump(...)
#endif
const ll INF = 1LL<<60;

int main(void) {
    ll n;
    cin >> n;
    vector<ll> x(n), y(n);
    REP(i, n) cin >> x[i];
    REP(i, n) cin >> y[i];

    vector<ll> ans(n+2);
    ans[n+1] = INF;
    REP(i, n) {
        ans[i+1] = x[i];
        chmin(ans[n+1], x[i]+y[i]);
    }
    REP(i, n+2) chmin(ans[i], ans[n+1]);

    cout << ans[n+1] << "\n";
    for(auto i: ans) cout << i << "\n";
    cout << flush;

    return 0;
}