#include<stdio.h>
int v[100],l,n;

void sort(int prim,int ultim)
{int i,j,q,aux;
	i=prim;
	j=ultim;
	q=v[(i+j)/2];
while(i<=j)
	{
		while(v[i]<q) i++;
		while(v[j]>q) j--;
if(i<j) {aux=v[i];v[i]=v[j];v[j]=aux;}
if(i<=j) {i++;
		  j--;}

	}
if(prim<=j) sort(prim,j);
if(i<=ultim) sort(i,ultim);

}

int main ()
{FILE *f=fopen("algsort.in","r");
FILE *g=fopen("algsort.out","w");

fscanf(f,"%d",&n);
for(l=1;l<=n;l++)
	fscanf(f,"%d",&v[l]);

sort(1,n);

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

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

}