#include<iostream>
using namespace std;

void quicksort(int v[100],int s,int d)
{
    int i=s,j=d;
    int aux;
    int pivot=v[(s+d)/2];
      while(i<=j)
        {while (v[i]<pivot)
            i++;
            while(v[j]>pivot)
                j--;
            if (i<=j)
             {aux=v[i];
              v[i]=v[j];
              v[j]=aux;
              i++;
              j--;
            }
       }
    if (s<j)
        quicksort(v,s,j);
    if (i<d)
        quicksort(v,i,d);
}

int main()
{
    int v[100],i,n;
    cin>>n;
    for(i=1;i<=n;i++)
        cin>>v[i];
    quicksort(v,1,n);
    for(i=1;i<=n;i++)
        cout<<v[i]<<" ";
    return 0;
}