#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using vl = vector<ll>;
template <class T> using vec = vector<T>;
template <class T> using vv = vec<vec<T>>;
template <class T> using vvv = vv<vec<T>>;
template <class T> using minpq = priority_queue<T, vector<T>, greater<T>>;
#define all(a) (a).begin(),(a).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, l, r) for(ll i = (l); i < (r); ++i)
#define rrep(i, l, r) for(ll i = (r)-1; i >= (l); --i)
#define sz(x) (ll) (x).size()
template <typename T>
bool chmax(T &a, const T& b) { return a < b ? a = b, true : false; }
template <typename T>
bool chmin(T &a, const T& b) { return a > b ? a = b, true : false; }

struct Edge {
    ll from, to, cost;
    Edge (ll from, ll to, ll cost = 1ll) : from(from), to(to), cost(cost) {}
};
struct Graph {
    vector<vector<Edge>> G;
    Graph() = default;
    explicit Graph(ll N) : G(N) {}
    size_t size() const {
        return G.size();
    }
    void add(ll from, ll to, ll cost = 1ll, bool direct = 0) {
        G[from].emplace_back(from, to, cost);
        if (!direct) G[to].emplace_back(to, from, cost);
    }
    vector<Edge> &operator[](const int &k) {
        return G[k];
    }
};
using Edges = vector<Edge>;
const int inf = 1000000009;
const int Nmax = 200000;

void solve(){
    int N; cin >> N;
    int a[Nmax]; rep(i, N) cin >> a[i];
    int b[Nmax]; rep(i, N) cin >> b[i];
    ll c[Nmax]; rep(i, N) c[i] = 0;
    vec<int> a_, b_;
    int idx;
    rep(i, N){
        a_.push_back(a[i]);
        idx = i;
        while(idx > 0){
            if(a_[idx-1] > a_[idx]){
                a_[idx-1] = a_[idx];
                idx--;
            }
            else break;
        }
        b_.push_back(b[i]);
        idx = i;
        while(idx > 0){
            if(b_[idx-1] > b_[idx]){
                b_[idx-1] = b_[idx];
                idx--;
            }
            else break;
        }
        rep(k, i+1){
            c[i] += min(a_[k], b_[i-k]);
        }
    }
    rep(i, N){
        cout << c[i] << " \n"[i == N-1];
    }
    return;
}

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
}