#include <fstream>
#include <stdlib.h>

using namespace std;

int n, sir[500000];

void qsort(int, int);
void read();
void write();

int main()
{
    read();
    qsort(0, n - 1);
    write();
    return 0;
}

void write()
{
    int i;
    ofstream fout ("algsort.out");
    for (i = 0; i < n; ++i)
    {
        fout << sir[i] << ' ';
    }
    fout.close();
}

void read()
{
    int i;
    ifstream fin ("algsort.in");
    fin >> n;
    for (i = 0; i < n; ++i)
    {
        fin >> sir[i];
    }
    fin.close();
}

void qsort(int li, int ls)
{
    if (ls <= li)
    {
        return;
    }
    int i = li, j = ls, p = 0, aux;
    while (i != j)
    {
        if (sir[i] > sir[j])
        {
            p = 1 - p;
            aux = sir[i];
            sir[i] = sir[j];
            sir[j] = aux;
        }
        i += p;
        j -= (1 - p);
    }
    qsort (li, i);
    qsort (i + 1, ls);
}