#include <cstdio>
#include <algorithm>
using namespace std;

FILE *in; FILE *out;
long i,n,a[500010];

int main () {
    in=fopen ("algsort.in","r"); out=fopen ("algsort.out","w");
    fscanf (in,"%ld",&n);
    for (i=0; i<n; i++) fscanf (in,"%ld",&a[i]);
    sort (a,a+n);
    for (i=0; i<n; i++) fprintf (out,"%ld ",a[i]);
    fprintf (out,"\n");
    fclose (in); fclose (out);
    return 0;
}