#include<stdio.h>

int i,v[500001],l,r,n;

void QUICKSORT (int v[],int l,int r)
{
	int i,j,aux,pv;
	i=l;
	j=r;
	pv=v[(l+r)/2];
      
    while (i<=j)
    {   
        while (v[i]<pv)
            i++;
        while (v[j]>pv)
            j--;
        if (i<=j) 
        {
            aux=v[i];
            v[i]=v[j];
            v[j]=aux;
            i++;
            j--;
        }
    }
    if (l<j)
        QUICKSORT(v,l,j);
    if (i<r)
        QUICKSORT(v,i,r);

}

int main()
{
    int k;
	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]);
       
    l=1;
    r=n;
    QUICKSORT(v,l,r);

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

}