#include <iostream>
using namespace std;
int n , a[1000001]
void qsort(int l,int r)
{
    int i , j , mid ,q;
    i = l;j = r;
    mid = a[(l + r) / 2];
    do
    {
        while (a[i] < mid) i++;
        while (a[j] > mid) j--;
        if (i <= j)
        {
            q = a[i]; a[i] = a[j]; a[j] =q;
            i++;j--;
        }
    }while (i <=j);
    if (l < j) qsort(l,j);
    if (r < i) qsort(r,i);
}
int main()
{
    cin >> n;
    for (int i = 1;i <= n;i++)
    {
        cin >>a[i];
        qsort(1,n)
    }
    for (int i = 1; i <= n; i++)
    {
        cout << a[i] << " ";
    }
    return 0;
}