#include <iostream>
using namespace std;

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

int v[100], n;

int pivot(int st, int dr) {
    int i = st, j = dr, di = 1, dj = 0;
    while(i < j) {
        if(v[i] > v[j]) {
            int aux = v[i];
            v[i] = v[j]
            v[j] = aux;
            di = 1-di;
            dj = 1-dj;
        }
        i += di;
        j -= dj;
    }
    return i;
}

void quicksort(int st, int dr) {
    if(st < dr) {
        int p = pivot(st, dr);
        quicksort(st, p-1);
        quicksort(p+1, dr);
    }
}


int main() {
    fin >> n;
    for(int i = 0; i < n; i++)
        fin >> v[i];

    quicksort(0, n-1);

    for(int i = 0; i < n; i++)
        fout << v[i] << ' ';