#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

int n,x[500001];

/*
int cmp(const void*a,const void*b)
{
    return *(int *)a-*(int *)b;
}*/
int main()
{
    int i,j,aux;
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    cin>>n;
    for (i=1;i<=n;i++)
        cin>>x[i];
    //qsort(x+1,n,sizeof(x[1]),cmp);

    bool ok=false;
    int in=1,sf=n;
    do
    {
        ok=true;
        for(i=1;i<n;i++)
        {
            if(x[i]>x[i+1])
            {
                in=i;
                i=n;
            }
        }
        i=in;
        for(j=in;j<=n;j++)
        {
            if(x[i]>x[j] && i<j)
            {
                aux=x[j];
                x[j]=x[i];
                x[i]=aux;
                i=j;
            }
        }
        for(i=1;i<n;i++)
            if(x[i]>x[i+1])
                ok=false;
    }
    while (!ok);
    for (i=1;i<=n;i++)
        cout <<x[i]<<" ";
    cout<<"\n";
    return 0;
}