#include <cstdio>
#define N 500001

using namespace std;

int v[N],n;

void quickSort(int v[], int stanga, int dreapta)
{
    int i=stanga,j=dreapta;
    int x;
    int pivot=v[(stanga+dreapta)/2];
    while (i<=j)
    {
        while(v[i]<pivot)
            i++;
        while(v[j]>pivot)
            j--;
        if (i<=j)
        {
              x=v[i];
              v[i]=v[j];
              v[j]=x;
              i++;
              j--;
        }
}
    if(stanga<j)
        quickSort(v,stanga,j);
    if(i<dreapta)
        quickSort(v,i,dreapta);
}

int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&v[i]);
    quickSort(v,1,n);
    for(int i=1;i<=n;i++)
        printf("%d ",v[i]);
    return 0;
}