#include <iostream>
#include <fstream>
using namespace std;

int pivot_medianof3(int v[], int st, int dr)
{
    int m = (st + dr) / 2;
    int p = dr;
    if (v[st] < v[m])
    {
        if (v[m] < v[dr])
            p = m;
    }
    else if (v[st] < v[dr])
        p = st;
    return p;
}

int partition_medianof3(int v[], int st, int dr)
{
    int p = pivot_medianof3(v, st, dr);
    int val = v[p];
    int aux;
    aux = v[st];
    v[st] = v[p];
    v[p] = aux;
    int loc = st;
    for (int i = st; i <= dr; i++)
        if (v[i] < val)
        {
            loc = loc + 1;
            aux = v[i];
            v[i] = v[loc];
            v[loc] = aux;
        }
    aux = v[st];
    v[st] = v[loc];
    v[loc] = aux;
    return loc;
}

void quicksort_medianof3(int v[], int st, int dr)
{
    if (st < dr)
    {
        int pi = partition_medianof3(v, st, dr);
        quicksort_medianof3(v, st, pi - 1);
        quicksort_medianof3(v, pi + 1, dr);
    }
}

int main()
{
    ifstream fin("algsort.in");
    ofstream fout("algsort.out");

    int n, i, v[500000];
    fin >> n;
    for (i = 0; i < n; i++)
        fin >> v[i];
    quicksort_medianof3(v, 0, n-1);
    for (i = 0; i < n; i++)
        fout << v[i] << ' ';

    fin.close();
    fout.close();

    return 0;
}