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