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

#define forn(i,n) for (int i=0; i<(n); i++)
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define f first
#define s second

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;

template<typename A, typename B> ostream& operator<<(ostream & cout, pair<A,B> const &p) {
    return cout << "("<< p.f << ", "<< p.s << ")";
}
template<typename A> ostream& operator<<(ostream &cout, vector<A> const & v) {
    cout << "[";
    forn(i, v.size()) {
        if(i) cout << ", ";
        cout << v[i];
    }
    return cout << "]";
}

// map<int, vector<int>> m;
// map<int, vector<pair<pair<int, int>, vector<int>>>> m2;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin >> n;
    vector<int> v;
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        v.push_back(x);
        // m[x].push_back(i);
    }

    struct S {
        int l, r;
        vector<int> inds;
        S(int _l, int _r, vector<int> _inds): l(_l), r(_r), inds(_inds) {}
    };

    vector<pair<int, pair<int, vector<int>>>> stck;
    stck.pb({MOD, {-1, {-1}}});
    vector<S> ans;
    vector<int> o(n, 0);
    v.pb(MOD);
    forn(i, n+1) {
        while(stck.back().f < v[i]) {
            auto s = stck.back();
            stck.pop_back();
            ans.pb(S(s.s.f, i-1, s.s.s));
        }
        if(stck.back().f == v[i]) {
            stck.back().s.s.pb(i);
        } else {
            stck.pb({v[i], {stck.back().s.s.back()+1, {i}}});
        }
    }
    
    // for(auto a: ans) {
    //     cout << a.l << " " << a.r << " " << a.inds << "\n";
    // }
    reverse(ans.begin(), ans.end());
    int cur_h = 2 * n;
    for (auto a: ans) {
        // cout << a.r <<  " " << a.l << " " << a.inds << endl;
        if (a.inds[0] == a.l || a.inds[a.inds.size() - 1] == a.r) {
            int i = 0;
            while(i < a.inds.size() && a.inds[i] == a.l + i) {
                o[a.l + i] = cur_h - i;
                i ++;
            }
            int j = 0;
            if (i != a.inds.size()) {
                while(j < a.inds.size() && a.inds[a.inds.size() - 1 - j] == a.r - j) {
                    o[a.r - j] = cur_h - j;
                    j++;
                }
            }
            if (i + j < a.inds.size()) {
                int mdx = a.inds[i];
                o[mdx] = cur_h - i - j;
            }
            cur_h -= i + j + 1;
        }
        else {
            for (auto idx: a.inds) {
                o[idx] = cur_h;
            }
            cur_h --;
        }
    }

    // cout << o << endl;
    for (int i = 0; i < n; i++) {
        cout << o[i] + 100000000 << " ";
    }
    cout << endl;
    // priority_queue<pair<int, pair<int, vector<int>>>> q;
    // for (int i = 0; i < n; i++) {
    //     while(!q.empty() && q.top().first < v[i]) {
    //         auto p = q.top();
    //         q.pop();
    //         m2[p.first].push_back(make_pair(make_pair(p.second.first, i - 1), p.second.second));
    //     }
    //     if (!q.empty() && q.top().first == v[i]) {
    //         q.top().second.second.push_back(i);
    //     }
    //     else if (!q.empty()) {
            
    //     }
    // }
    
}