#include <fstream>
#include <algorithm>

using namespace std;

int cmp( const void*x, const void *y ) {
    return *(int*)x - *(int*)y;
}
int main()
{
    ifstream in ("algsort.in");
    ofstream out ("algsort.out");
    int a[500000]={0}, n, sz=sizeof(int);
    in>>n; for (int i=0; i<n; ++i) in>>a[i];
    qsort(a,n,sz,cmp);
    for (int i=0; i<n; ++i) out<<a[i]<<' ';
    return 0;
}