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

#define endl '\n'
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define F(i,j,k) fill(i[0],i[0]+j*j,k)
#define P(p) cout<<(p)<<endl;
#define SORT(v) sort(ALL(v))
#define SORTD(v) sort(ALL(v), greater<int>())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define INF 1<<30
#define v(T) vector<T>
#define vv(T) v(v(T))
#define print(x) cout<<(x)<<endl
#define printv(v) for(auto i : v){cout<<i<<" ";}cout<<endl
#define printu(v) for(auto i : v){print(i);}
#define readv(v, n) for (int i=0;i<n;i++)cin >> v[i]
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int,int> pii;
typedef pair<long,long> pll;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void debug_print() {}
template <class Head, class... Tail>
void debug_print(Head&& head, Tail&&... tail)
{
        cout << (head) << endl;
        debug_print(forward<Tail>(tail)...);
}
int i, j, k;
int main()
{
        cin.tie(0);
        ios::sync_with_stdio(false);
        int N;
        cin >> N;

        vi xs;
        vi ys;
        rep(i, N) {
            int t;
            cin >> t;
            xs.push_back(t);
        }
        rep(i, N) {
            int t;
            cin >> t;
            ys.push_back(t);
        }
        int R = INF;
        rep(i, N) {
            R = min(xs[i] + ys[i], R);
        }

        print(R);
        print(0);
        rep(i,N) {
            print(max(0, R - ys[i]));
        }
        print(R);
        // write something.
        return 0;
}