#include <fstream>
#include <iostream>

using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");

int v[500001],n;

void gnome ()
{
    int poz = 1;
    while ( poz <= n )
    {
        if ( poz == 1 or v[poz] >= v[poz-1]) poz++;
        else
        {
            swap(v[poz],v[poz-1]);
            poz--;
        }
    }
}

int i;
int main()
{
    f >> n;
    for ( i = 1; i <= n ; ++i )
        f >> v[i];
    gnome();
    for ( i = 1; i <= n; ++i )
        g << v[i] << " " ;
    return 0;
}