#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

template<class S,
  S (*op)(S, S),
  S (*e)(),
  class F,
  S (*prop)(S, F),
  F (*merge)(F, F),
  F (*id)()>
struct LazySegTree {
 public:
  LazySegTree() : LazySegTree(0) {}
  LazySegTree(int n) : LazySegTree(vector<S>(n, e())) {}
  LazySegTree(int n, S v) : LazySegTree(vector<S>(n, v)) {}
  LazySegTree(const vector<S>& v) : _n(int(v.size())) {
    lg = 0;
    while ((1U << lg) < (unsigned int)(_n)) lg++;
    siz = 1 << lg;
    d = vector<S> (2*siz, e());
    lz = vector<F> (siz, id());
    for (int i = 0; i < _n; ++i) {
      d[siz+i] = v[i];
    }
    for (int i = siz-1; i >= 1; --i) update(i);
  }
 
  void set(int p, S x) {
    assert(0 <= p && p < _n);
    p += siz;
    for (int i = lg; i >= 1; --i) push(p >> i);
    d[p] = x;
    for (int i = 1; i <= lg; ++i) update(p >> i);
  }
 
  S get(int p) {
    assert(0 <= p && p < _n);
    p += siz;
    for (int i = lg; i >= 1; --i) push(p >> i);
    return d[p];
  }
 
  S prod(int l, int r) {
    assert(0 <= l && l <= r && r <= _n);
    if (l == r) return e();
 
    l += siz, r += siz;
 
    for(int i = lg; i >= 1; --i) {
      if (((l >> i) << i) != l) push(l >> i);
      if (((r >> i) << i) != r) push(r >> i);
    }
 
    S sml = e(), smr = e();
    while(l < r) {
      if (l & 1) sml = op(sml, d[l++]);
      if (r & 1) smr = op(d[--r], smr);
      l >>= 1, r >>= 1;
    }
 
    return op(sml, smr);
  }
 
  void apply(int l, int r, F f) {
    assert(0 <= l && l <= r && r <= _n);
    if (l == r) return;
 
    l += siz, r += siz;
 
    for (int i = lg; i >= 1; --i) {
      if (((l >> i) << i) != l) push(l >> i);
      if (((r >> i) << i) != r) push((r-1) >> i);
    }
 
    {
      int l2 = l, r2 = r;
      while(l < r) {
        if (l & 1) eval(l++, f);
        if (r & 1) eval(--r, f);
        l >>= 1, r >>= 1;
      }
      l = l2, r = r2;
    }
    
    for(int i = 1; i <= lg; ++i) {
      if (((l >> i) << i) != l) update(l >> i);
      if (((r >> i) << i) != r) update((r-1) >> i);
    }
  }

  using G = function<bool(S)>;

  // max_{r \in [l, n]} f(prod(l, r)) == true
  int max_right(int l, G f) {
    assert(0 <= l && l <= _n);
    assert(f(e()));
    if (l == _n) return _n;
    l += siz;
    for (int i = lg; i >= 1; --i) {
      push(l >> i);
    }
    S v = e();
    do {
      while(l % 2 == 0) l >>= 1;
      if (!f(op(v, d[l]))) {
        while(l < siz) {
          push(l);
          l *= 2;
          if (f(op(v, d[l]))) {
            v = op(v, d[l]);
            ++l;
          }
        }
        return l - siz;
      }
      v = op(v, d[l]);
      ++l;
    } while((l & -l) != l);
    return _n;
  }

 private:
  int _n, siz, lg;
  vector<S> d;
  vector<F> lz;
 
  void update(int k) { d[k] = op(d[2*k], d[2*k+1]); }
  void eval(int k, F f) {
    d[k] = prop(d[k], f);
    if (k < siz) lz[k] = merge(lz[k], f);
  }
  
  void push(int k) {
    eval(2*k, lz[k]);
    eval(2*k+1, lz[k]);
    lz[k] = id();
  }
};
// merge(f, g)(x) = g(f(x))

using S = ll;
using F = ll;
 
S op(S a, S b) { return max(a, b); }
S e() { return 0; }
S prop(S a, F f) { return a+f; }
F merge(F f, F g) { return f+g; }
F id() { return 0; }

template<class S, S (*op)(S, S), S (*e)()>
struct SparseTable {
  vector<vector<S>> st;
  vector<int> up;
  SparseTable(const vector<S> &v) {
    int b = 0;
    while((1U << b) <= v.size()) ++b;
    st.assign(b, vector<S>(1<<b, e()));
    for (int i = 0; i < (int)v.size(); ++i) {
      st[0][i] = v[i];
    }
    for (int i = 1; i < b; ++i) {
      for (int j = 0; j + (1 << i) <= (1 << b); ++j) {
        st[i][j] = op(st[i-1][j], st[i-1][j+(1<<(i-1))]);
      }
    }
    up.resize(v.size()+1);
    for (int i = 2; i < (int)up.size(); ++i) {
      up[i] = up[i>>1] + 1;
    }
  }

  inline S prod(int l, int r) {
    if (l == r) return e();
    int b = up[r-l];
    return op(st[b][l], st[b][r-(1<<b)]);
  }
};

P op0(P a, P b) {
  if (a.fi <= b.fi) return a;
  return b;
}
P e0() { return {-1, -1}; }

int main() {
  int n;
  cin >> n;
  vector<int> a(n), b(n);
  rep(i,0,n) cin >> a[i];
  rep(i,0,n) cin >> b[i];
  vector<P> va(n), vb(n);
  rep(i,0,n) va[i] = {a[i], i}, vb[i] = {b[i], i};
  SparseTable<P,op0,e0> sta(va), stb(vb);
  LazySegTree<S,op,e,F,prop,merge,id> seg(n);
  function<void(int,int)> f = [&](int l, int r) {
    if (l == r) return;
    P p1 = sta.prod(l, r), p2 = stb.prod(l, r);
    if (p1.fi <= p2.fi) {
      seg.apply(p1.se, r, 1LL*p1.fi*(p1.se-l+1));
      f(l, p1.se), f(p1.se+1, r);
    } else {
      seg.apply(p2.se, r, 1LL*p2.fi*(p2.se-l+1));
      f(l, p2.se), f(p2.se+1, r);
    }
  };
  f(0, n);
  rep(i,0,n) {
    cout << seg.get(i) << " ";
  }
  cout << endl;
  return 0;
}