#include<bits/stdc++.h>
using namespace std;
#define in f
#define out g


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

int n;
int v[500010];

int arange(int l, int r) {

    int index = l;
    int pivot = v[rand() % (r - l) + l + 1];
    for(int i = l; i < r; ++i) {
        if(v[i] <= pivot) {
            swap(v[i], v[index]);
            ++index;
        }
    }
    swap(v[index], pivot);
    return index;
}

int quick(int l, int r) {

    if(r - l >= 1) {
        int index = arange(l, r);
        quick(l, index - 1);
        quick(index + 1, r);
    }

}

int main() {

    in >> n;
    for(int i = 1; i <= n; ++i) {
        in >> v[i];
    }
    quick(1, n);
    for(int i = 1; i <= n; ++i) {
        out << v[i] << " ";
    }

}