#include <iostream>
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin>>n;
    vector<int> a(n);
    for (int i=0; i<n; i++)
        cin>>a[i];
    int i, j;
    if (a[n-1]>a[n-2])

        swap(a[n-1], a[n-2]);
    else
    {
        i=n-2;
        while(a[i]>a[i+1])
           i--;
        j=n-1;
        while (a[i]>a[j])
        {
            j--;
        }
        swap(a[i], a[j]);

        vector<int> utolsok;
        for(int k=i+1; k<n; k++)
            utolsok.push_back(a[k]);
        sort(utolsok.begin(), utolsok.end());
        int hatar;
        for (int k=0; k<utolsok.size(); k++)
        {
            if (a[k]>a[i])
            {
                hatar=k;
                break;
            }
        }
        j=1;
        for (int k=hatar-1; k>=0; k--)
        {
            a[i+j]=utolsok[k];
            j++;
        }
        for (int k=hatar; k<utolsok.size(); k++)
                a[i+k+1]=utolsok[k];
    }
    for (int k=0; k<n; k++)
        cout<<a[k]<<" ";
    return 0;
}