#include <bits/stdc++.h>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");

void QuickSort(int v[], int st, int dr)
{
    if(st < dr)
    {
        //pivotul este inițial v[st]
        int m = (st + dr) / 2;
        int aux = v[st];
        v[st] = v[m];
        v[m] = aux;
        int 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()
{   int n;
    f>>n;
    int v[n];
    for (int i = 0; i < n; ++i) {
        f>>v[i];
    }
    QuickSort(v,0,n-1);
    for (int i = 0; i < n; ++i) {
        g<<v[i]<<" ";
    }
    return 0;
}