#include<stdio.h>
int v[20000],n,i;
void sort(int prim,int ultim)
{int i,j,q;
if(prim<ultim)
	{q=v[prim]; i=prim; j=ultim;
while(i<j)
{while(i<j && v[j]>=q) j--;
v[i]=v[j];
while(i<j && v[i]<=q) i++;
v[j]=v[i];}
v[i]=q;
sort(prim,i-1);
sort(i+1,ultim);}}
int main ()
{FILE *f= fopen("algsort.in","r");
FILE *g= fopen ("algsort.out","w");
fscanf(f,"%d",&n);
for(i=1;i<=n;i++) fscanf(f,"%d",&v[i]);
sort(1,n);
for(i=1;i<=n;i++) fprintf(g,"%d",v[i]);
fclose(f);
fclose(g);
return 0;
}