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