#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/segtree>

struct F{
    ll v = 0;
    ll c = 0;
};

F op(F l, F r){
    return {l.v + r.v, l.c + r.c};
}
F e(){
    return F{};
}

ll target;

bool f(F x){
    return x.c <= target;
}

void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N;
    cin >> N;
    vector<ll> A(N * 2);
    rep(i, 0, N * 2) cin >> A[i];
    vector<int> order(N * 2), inv(N * 2);
    rep(i, 0, N * 2) order[i] = i;
    sort(all(order), [&](int l, int r){
        return A[l] < A[r];
    });
    rep(i, 0, N * 2) inv[order[i]] = i;
    vector<stack<int>> st(2);
    atcoder::segtree<F, op, e> seg(N * 2);
    rep(i, 0, N){
        rep(j, 0, 2){
            int ind = i + j * N;
            while (!st[j].empty()){
                if (inv[st[j].top()] < inv[ind]) break;
                seg.set(inv[st[j].top()], F{});
                st[j].pop();
            }
            ll c = i + 1;
            if (!st[j].empty()) c = i - st[j].top() % N;
            seg.set(inv[ind], {A[ind] * c, c});
        }
        target = i;
        int r = seg.max_right<f>(0);
        auto tmp = seg.prod(0, r);
        ll ans = tmp.v;
        ans += (target + 1 - tmp.c) * A[order[r]];
        cout << ans << (i + 1 == N ? "\n" : " ");
    }
}