//Quicksort
#include <cstdio>
#define N 500001

int V[N],n,i;

int poz(int a, int b)
{
    int t,i,j;
    for (i=0, j=-1; a<b; a+=i, b+=j)
        if (V[a]>V[b])
        {
            t=V[a]; V[a]=V[b]; V[b]=t;
            t=i; i=-j; j=-t;
        }
    return a;
}

void sort(int a, int b)
{
    if (a<b)
    {
        int m=poz(a,b);
        sort(a,m-1);
        sort(m+1,b);
    }
}

int main()
{
	freopen("algsort.in","r",stdin);
	freopen("algsort.out","w",stdout);
	scanf("%d\n",&n);
	for (i=1; i<=n; i++) scanf("%d",&V[i]);
	sort(1,n);
    for (i=1; i<=n; i++) printf("%d ",V[i]);

    return 0;
}