#include<iostream>
#include<cstdlib>
#include<fstream>
#include<ctime>
using namespace std;
int v[500000],n;
int pivot(int left, int right)
{
    int p1,p2,p3,p,mini,maxi;
    p1=v[left + rand() % (right-left+1)];
    p2=v[left + rand() % (right-left+1)];
    p3=v[left + rand() % (right-left+1)];
    if(p1<=p2&&p1<=p3)
        mini=p1;
    if(p2<=p1&&p2<=p3)
        mini=p2;
    if(p3<=p1&&p3<=p2)
        mini=p3;
    if(p1>=p2&&p1>=p3)
        maxi=p1;
    if(p2>=p1&&p2>=p3)
        maxi=p2;
    if(p3>=p1&&p3>=p2)
        maxi=p3;
    p=p1+p2+p3-maxi-mini;
    return p;

}
void quicksort(int left, int right)
{
    int i=left, j=right, tmp, piv;
    piv=pivot(left,right);
    while(i<=j)
    {
        while(v[i]<piv)
            i++;
        while(v[j]>piv)
            j--;
        if(i<=j)
        {
            tmp=v[i];
            v[i]=v[j];
            v[j]=tmp;
            i++;
            j--;
        }
    }
    if(left<j)
        quicksort(left,j);
    if(i<right)
        quicksort(i,right);

}
int main()
{
    ifstream f("algsort.in");
    ofstream g("algsort.out");
    int u;
    f>>n;
    for(u=0;u<n;u++)
        f>>v[u];
    quicksort(0,n-1);
    for(u=0;u<n;u++)
        g<<v[u]<<" ";
    f.close();
    g.close();
    return 0;
}