#include <algorithm>
#include <fstream>

using namespace std;

FILE*fin=fopen("algsort.in","r");
FILE*fout=fopen("algsort.out","w");

int v[500001],n,i;


int main()
{
    fscanf(fin,"%d",&n);

    for(i = 1; i <= n; ++i)
        fscanf(fin,"%d",&v[i]);

    sort(v+1,v+n+1);

    for(i = 1; i <= n; ++i)
        fprintf(fout,"%d ",v[i]);
    return 0;
}