#include<stdio.h>
#include<algorithm>
using namespace std;
FILE *in,*out;
int v[500001],i,n;
int main()
{
    in=fopen("algsort.in","rt");
    out=fopen("algsort.out","wt");
    fscanf(in,"%d",&n);
    for(i=1;i<=n;i++)
        fscanf(in,"%d",&v[i]);
    sort(v+1,v+n+1);
    for(i=1;i<=n;i++)
        fprintf(out,"%d ",v[i]);
    fclose(in);
    fclose(out);
    return 0;
}