/*
    Keep It Simple!
*/

#include<stdio.h>

int v[500005],n;

void Quick(int left,int right)
{
    int i = left, j = right, mid = (left+right)/2;

    while(i<=j)
    {
         while(v[i]<v[mid]) i++;
         while(v[j]>v[mid]) j--;

         if(i <= j )
         {
            int aux = v[i];
            v[i] = v[j];
            v[j] = aux;
            i++; j--;
         }
    }

    if( left < j)
     Quick(left,j);
    if( i < right)
     Quick(i,right);
}

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]);

   Quick(1,n);

   for(int i=1;i<=n;i++) printf("%d ",v[i]);

}