#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
void kovetkezo(vector<int>& a, int n)
{
   int i, j;
    i=n-2;
    while ((i>=0)&&(a[i]>a[i+1]))
        i--;

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

bool vanbenne(vector<int>& a, int n)
{
    int i, j, k;
    for (i=0; i<n-2; i++)
        for (j=i+1; j<n-1; j++)
           for (k=j+1; k<n; k++)
              if (a[i]>a[j] && a[i]>a[k] && a[j]<a[k])
                 return true;
    return false;
}
int main()
{
    int n, i;
    cin>>n;
    vector<int> a(n);
    for (i=0; i<n; i++)
        cin>>a[i];
    kovetkezo(a, n);
    while (vanbenne(a, n))
        kovetkezo(a, n);
    for (i=0; i<n; i++)
        cout<<a[i]<<" ";
    return 0;
}