#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
using namespace std;

#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)

typedef long long ll;
typedef uint64_t ull;
typedef pair<int, int> P;
typedef pair<int, double> Pid;
typedef pair<double, int> Pdi;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<int, pair<int, int>> PP;
typedef pair<P, int> PPi;
constexpr double PI = 3.1415926535897932;   // acos(-1)
constexpr double EPS = 1e-9;
constexpr int INF = 1001001001;
constexpr int mod = 1e+9 + 7;
// constexpr int mod = 998244353;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<ll> x(n), y(n);
    ll xmin = 1e+9, ymin = 1e+9;
    for(int i = 0; i < n; ++i){
        cin >> x[i];
        chmin(xmin, x[i]);
    }
    for(int i = 0; i < n; ++i){
        cin >> y[i];
        chmin(ymin, y[i]);
    }
    vector<int> res(n + 2);
    res[0] = 0, res[n + 1] = xmin + ymin;
    for(int i = 0; i < n; ++i){
        if(x[i] - y[i] > res[n + 1]){
            res[i + 1] = y[i] + res[n + 1];
        }
        else if(x[i] - y[i] == res[n + 1]){
            res[i + 1] = x[i];
        }
        else{
            res[i + 1] = x[i];
        }
    }
    cout << res[n + 1] << endl;
    for(int i = 0; i <= n + 1; ++i) cout << res[i] << "\n";
}