#include <iostream>
#include <fstream>

using namespace std;

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

long long int v[500010], n, aux, i, j, d, m;

void quicksort(long long int v[], int st, int dr)
{
    if(st < dr)
    {
        m = (st + dr) / 2;
        aux = v[st];
        v[st] = v[m];
        v[m] = aux;
        i = st, j = dr, d = 0;
        while(i < j)
        {
            if(v[i] > v[j])
            {
                aux = v[i];
                v[i] = v[j];
                v[j] = aux;
                d = 1 - d;
            }
            i += d;
            j -= 1 - d;
        }
        quicksort(v, st, i - 1);
        quicksort(v , i + 1, dr);
    }
}

int main()
{
    fin >> n;
    for(i = 1; i <= n; i++)
        fin >> v[i];
    quicksort(v, 1, n);
    for(i = 1; i <= n; i++)
        fout << v[i] << " ";
    return 0;
}