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