#include <stdio.h>
int const N=500001;
int v[N],rez[N],n;

int aux[N];
void myMerge(int st,int dr)
{
    int i,j,k,m=(st+dr)/2;
    i=k=st;
    j=m+1;
    while(i <= n && j <= dr)
        if(v[i] <= v[j])
            aux[k++] = v[i++];
        else
            aux[k++] = v[j++];
    while(i <= n) aux[k++] = v[i++];
    while(j <= dr) aux[k++] = v[j++];
    for(i=st;i<=dr;i++)
        v[i] = aux[i];

}

void ms(int st,int dr)
{
    if(st == dr) return;
    int m = (st+dr)/2;
    ms(st,m);
    ms(m+1,dr);
    myMerge(st,dr);
}

int main()
{
    int i,j,k=1;
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        scanf("%d",&v[i]);
    ms(1,n);
    i=1;
    j=n/2+1;
    while(i<=n/2 || j<=n)
    {
        if(v[i] <= v[j] && i<=n/2)
            rez[k++] = v[i++];
        else
            rez[k++] = v[j++];
    }
    for(i=1;i<=n;i++)
        printf("%d ",rez[i]);
    return 0;
}