#include <iostream>
#include <fstream>
#include <vector>
#include <cstdlib>
#include <ctime>
#include <algorithm>

using namespace std;

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

int choose_pivot(int st, int dr) {
    return st + rand() % (dr - st + 1);
}

int partition(vector <int> &a, int st, int dr) {
    int m = choose_pivot(st, dr);
    swap(a[m], a[dr]);
    int i = st - 1, j = dr;
    while (true) {
        do
            i++;
        while (a[i] < a[dr]);
        do
            j--;
        while (a[j] > a[dr]);
        if (i < j) {
            swap(a[i], a[j]);
        }
        else
            break;
    }
    swap(a[i], a[dr]);
    return i;
}

void quicksort(vector <int> &a, int st, int dr) {
    if (st >= dr) {
        return;
    }

    int p = partition(a, st, dr);
    quicksort(a, st, p - 1);
    quicksort(a, p + 1, dr);
}

int main() {
    int n;
    in >> n;
    vector <int> a(n);
    for (int i = 0; i < n; i++) {
        in >> a[i];
    }

    srand(time(NULL));
    quicksort(a, 0, n - 1);
    for (int i = 0; i < n; i++) {
        out << a[i] << ' ';
    }
    out << '\n';
    return 0;
}