#include <stdio.h>
#include <stdlib.h>
#include <algorithm>

int v[500000];
int i,n,aux;
FILE *in, *out;
int compare(const void * a,const void * b)
{
	return ( *(int*)a - *(int*)b);
}
int main()
{
	in=fopen("algsort.in","r");
	fscanf(in,"%d",&n);
	for (i=1;i<=n;++i) fscanf(in,"%d", &v[i]);
	fclose(in);
	sort(v+1,v+n+1);
      //	qsort(v,n,sizeof(int),compare);
      //	aux=v[n-1];
      //	v[n-1]=v[n];
      //	v[n]=aux;
	out=fopen("algsort.out","w+");
	for (i=1;i<=n;++i) fprintf(out,"%d", v[i]);
	fclose(out);
return 0;
}