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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n;cin >> n;
    vector<int> P(n);
    vector<int> pr(n);
    int mx = 0;

    for (int i = 0; i < n; ++i) {
        cin >> P[i];
        pr[i] = mx;
        if (P[i] > mx) {
            mx = P[i];
        }
    }

    set<int> a;
    for (int i = n - 1; i >= 0; --i) {
        a.insert(P[i]);

        int v = -1; 
        int pm = pr[i];

        auto itA = a.upper_bound(max(P[i], pm));
        if (itA != a.end()) {
            v = *itA;
        }

        auto itL = a.lower_bound(pm);
        if (itL != a.begin()) {
            int L = *(--itL);
            if (L > P[i]) {
                if (v == -1 || L < v) {
                    v = L;
                }
            }
        }

        if (v != -1) {
            P[i] = v;
            a.erase(v);

            int new_max = max(pm, v);
            vector<int> low, high;
            for (int x : a) {
                if (x < new_max) low.push_back(x);
                else high.push_back(x);
            }

            reverse(low.begin(), low.end());
            for (int j = 0; j < i; ++j) cout << P[j] << " ";
            cout << P[i];
            for (int x : low) cout << " " << x;
            for (int x : high) cout << " " << x;
            cout << endl;

            return 0;
        }
    }

    return 0;
}