#include <bits/stdc++.h>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int v[1000001];
void quiksort(int st, int dr, int v[ ])
{

    int piv;
    piv = v[(st+dr)/2];
    int i = st;
    int j = dr;

    while(i <= j)
    {
        while(v[i] < piv)
            i++;
        while(v[j] > piv)
            j--;
        if(i <= j)
        {
            swap(v[i], v[j]);
            i++;
            j--;
        }

    }

    if(st < j)
        quiksort( st, j, v);
    if(i < dr)
        quiksort(i, dr, v);
}
int main()
{
    int n;
    f >> n;

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