#include<cstdio>
#include<algorithm>
using namespace std;
FILE *f=fopen("algsort.in","r");
FILE *g=fopen("algsort.out","w");

long n,v[500000];

int main()
{ fscanf(f,"%ld",&n);
long i;
for (i=1;i<=n;i++)
fscanf(f,"%ld",&v[i]);

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

for (i=1;i<=n;i++)
fprintf(g,"%ld ",v[i]);

fclose(f);
fclose(g);
return 0;
}