#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,aux,i,j,v[500001];
int main()
{
    f >> n;
    for(i = 1; i <= n; ++i)
        f >> v[i];
    /*for(i = 1; i <= n; ++i)
        for(j = i + 1; j <= n; ++j)
            if(v[i] > v[j])
            {
                aux = v[i];
                v[i] = v[j];
                v[j] = aux;
            }*/
    sort(v + 1, v + n + 1);
    for(i = 1; i <= n; ++i)
        g << v[i] << " ";
    g << '\n';
    return 0;
}