#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 pivot = v[rand() % (r - l) + l + 1];
    int i = l;
    int j = r;

    while(i <= j)
    {
        while(v[i] < pivot)
        {
            i++;
        }

        while(v[j] > pivot)
        {
            j--;
        }

        if(i <= j)
        {
            swap(v[i], v[j]);
            i++;
            j--;
        }
    }
    return i;
}

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] << " ";
    }

}