#include <bits/stdc++.h>

#define pb push_back
#define mp make_pair
#define MAXN 100001
#define DIM 8192

using namespace std;

class Reader
{
public:
    Reader(const char* filename)
    {
        if(filename[0]=='.'||filename[0]==0)
        {
            cout<<"Check INFILE.\n";
            return;
        }
        try
        {
            f.open(filename);
            pos = 0;
            if(f.fail())throw 1;
            f.read(buffer,DIM);
        }
        catch(int e)
        {
            cout<<"No INFILE.\n";
            delete this;
        }
    }
    inline Reader& operator >>(int& x)
    {
        x=0;
        sgn=1;
        while((buffer[pos]<'0'||buffer[pos]>'9')&&buffer[pos]!='-')
            if(++pos==DIM)
                f.read(buffer,DIM),pos=0;
        if(buffer[pos]=='-')
		{
			sgn=-1;
			if(++pos==DIM)f.read(buffer,DIM),pos=0;
		}
        while(buffer[pos]>='0'&&buffer[pos]<='9')
        {
            x=x*10+buffer[pos]-'0';
            if(++pos==DIM)f.read(buffer,DIM),pos=0;
        }
        x*=sgn;
        return (*this);
    }
    inline Reader& operator >>(char* c)
    {
        aux = 0;
        while(isspace(buffer[pos]))
            if(++pos==DIM)
                f.read(buffer,DIM),pos=0;
        while(!isspace(buffer[pos]))
        {
            c[aux++]=buffer[pos];
            if(++pos==DIM)f.read(buffer,DIM),pos=0;
        }
        return (*this);
    }
    ~Reader()
    {
        f.close();
    }
private:
    ifstream f;
    int pos,aux,sgn;
    char buffer[DIM];
};

class Writer
{
public:
    Writer(const char* filename)
    {
        if(filename[0]=='.'||filename[0]==0)
            cout<<"Check OUTFILE. Nothing created.\n";
        else
        {
            g.open(filename);
            pos = 0;
        }
    }
    inline Writer& operator <<(const int& xx)
    {
        aux = 0;
        x = xx;
        if(xx<0)x=-x;
        if(x==0)
            nr[aux++]='0';
        while(x)
        {
            nr[aux++]=x%10+'0';
            x/=10;
        }
        if(xx<0)nr[aux++]='-';
        while(aux>0)
        {
            buffer[pos++]=nr[--aux];
            if(pos==DIM)g.write(buffer,DIM),pos=0;
        }
        return (*this);
    }
    inline Writer& operator <<(const char* c)
    {
        aux = 0;
        while(c[aux])
        {
            buffer[pos++]=c[aux++];
            if(pos==DIM)g.write(buffer,DIM),pos=0;
        }
        return (*this);
    }
    inline void flush()
    {
        g.write(buffer,pos);
        pos=0;
    }
    ~Writer()
    {
        g.write(buffer,pos);
        g.close();
    }
private:
    ofstream g;
    int pos,aux,x;
    char buffer[DIM],nr[21];
};


Reader f("algsort.in");
Writer g("algsort.out");

void dropsort(int n, int* els)
{
    int size1=0, size2=0;
    int* aux1=new int[n+1];
    int* aux2=new int[n+1];
    aux1[0]=0;
    for(int i=1;i<=n;i++)
        if(els[i]>=aux1[size1])
            aux1[++size1]=els[i];
        else aux2[++size2]=els[i];
    if(size1==n)
    {
        delete aux2;
        delete els;
        els=aux1;
        return;
    }
    if(size1>=(n+1)>>1)
    {
        n=0;
        dropsort(size2,aux2);
        for(int i=1,j=1;i<=size1&&j<=size2;)
            if(aux1[i]>aux2[j])
                els[++n]=aux2[j],j++;
            else
                els[++n]=aux1[i],i++;
        delete aux1;
        delete aux2;
        return;
    }
    aux1[0]=2147483647;
    size1=0, size2=0;
    for(int i=1;i<=n;i++)
        if(els[i]<=aux1[size1])
            aux1[++size1]=els[i];
        else aux2[++size2]=els[i];
    if(size1==n)
    {
        delete aux2;
        for(int i=1;i<=n;i++)
            els[i]=aux1[n+1-i];
        delete aux1;
        return;
    }
    n=0;
    dropsort(size2,aux2);
    for(int i=size1,j=1;i>0||j<=size2;)
        if(aux1[i]>aux2[j])
            els[++n]=aux2[j],j++;
        else
            els[++n]=aux1[i],i--;
    delete aux1;
    delete aux2;
}

int main()
{
    ios_base::sync_with_stdio(false);
    int n;
    f>>n;
    int* base = new int[n+1];
    for(int i=1;i<=n;i++)
        f>>base[i];
    dropsort(n,base);
    for(int i=1;i<=n;i++)
        g<<base[i]<<" ";
    return 0;
}