#include <fstream>

using namespace std;
ifstream f("quicksort.in");
ofstream g("quicksort.out");
int n,v[10001],i;
void quicksort(int x,int y)
{
    int i,j,mij;
    i=x;
    j=y;
    mij=(x+y)/2;
     while(i<=j)
    {
        while(v[i]<v[mij])i++;
        while(v[j]>v[mij])j--;
        if(i<=j){swap(v[i],v[j]);
        i++;
        j--;}
    }
    if(x<j)quicksort(x,j);
    if(y>i)quicksort(i,y);
}
int main()
{
    f>>n;
    for(i=1; i<=n; i++)f>>v[i];
    quicksort(1,n);
    for(i=1; i<=n; i++)g<<v[i]<<" ";
    return 0;
}