#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n=6000;
    cin >> n; 
    vector<int> X(n, 0);
  
    for (size_t i = 0; i < n; i++)
    {
        cin >> X[i];
    }
    vector<int> Y;
    int db = n - 1;
   // Y.push_back(X[n - 1]);
    while (db>0&&(X[db]<=X[db-1]))
    {
        Y.push_back(X[db]);
        db--;
    }
    int ut = X[db - 1];
    Y.push_back(X[db]);
    Y.push_back(X[db-1]);
    sort(Y.begin(),Y.end());
    int maxy = Y.capacity()-1;
    while (Y[maxy-1]>ut)
    {
        maxy--;
    }
    
    X[db - 1] = Y[maxy];
    for (int i = maxy-1; i >=0; i--)
    {
        if (db < X.capacity())
        {
            X[db] = Y[i];
            db++;
        }
    }
    for (int i = Y.capacity()-1; i > maxy; i--)
    {
        if (db < X.capacity())
        {
            X[db] = Y[i];
            db++;
        }
    }
    for (auto a : X)
    {
        cout << a<<" ";
    }
    cout << endl;
   
}