#include<algorithm>
#include<fstream>
#define NMAX 500000
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");

int v[NMAX],n;

int main (void)
{
    in>>n;
    for(int i=0;i<n;++i)
        in>>v[i];
    in.close();
    //Insertion Sort
    int x,i;
    for (int j=1;j<n;++j)
    {
        x=v[j];
        i=j-1;
        while ( i>=0 && v[i]>x )
        {
            v[i+1]=v[i];
            i--;

        }
        v[i+1]=x;
    }

    for(int i=0;i<n;++i)
        out<<v[i]<<" ";
    out.close();
    return 0;
}