//quick sort in stl
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");

constexpr int NX {500010};
int v[NX];

int cmp(const void *a, const void *b)
{
    return *(int *)a - *(int *)b;
}

int main()
{
    int n;
    fin>>n;
    for(int i=0; i<n; ++i)
        fin>>v[i];

    qsort(v, n, sizeof( v[0] ), cmp);

    for(int i=0; i<n; ++i)
        fout<<v[i]<<" ";

    return 0;
}