#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

ifstream fin ("algsort.in");
ofstream fout ("algsort.out");

const int nmax = 500005;
int v[nmax];

void insertion_sort(int st, int dr)
{
    int i, j, x;
    for(i=st; i<=dr; i++)
    {
        x=v[i];
        j=i-1;
        while(j>0 && v[j] > x)
        {
            v[j+1]=v[j];
            j--;
        }
        v[j+1]=x;
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    int n, i;
    fin >> n;
    for(i=1; i<=n; i++)
        fin >> v[i];
    insertion_sort(1, n);
    for(i=1; i<=n; i++)
        fout << v[i] << " ";
    fin.close();
    fout.close();
    return 0;
}