#include <fstream>

using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");

int n,x[500001];

void quickSort(int x[500001],int left,int right){

    int i=left,j=right;
    int pivot=x[(left+right)/2];

    while(i<=j){
        while(x[i]<pivot)
                i++;
        while(x[j]>pivot)
                j--;

        if(i<=j){
            swap(x[i],x[j]);
            i++,j--;
        }
    }

    if(left<j)
        quickSort(x,left,j);
    if(i<right)
        quickSort(x,i,right);

}


int main()
{
    f>>n;
    for(int k=1;k<=n;k++)
        f>>x[k];

    quickSort(x,1,n);

    for(int i=1;i<=n;i++)
            g<<x[i]<<" ";

}