#include <bits/stdc++.h>

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

const int NMax = 500001;
const int prim = 3;

int a[NMax];
int n;

int myRandFunction(int l, int r){
    int e = (l << 2) * prim;
    e %= (r - l + 1);
    e *= r;
    e %= (r - l + 1);
    e += l;
    return e;
}
int myPartition(int l, int r){
    int position = myRandFunction(l,r);

    swap(a[position],a[r]);

    int i = l - 1;
    int j = l;
    for(j = l; j < r; ++j){
        if(a[j] <= a[r]){
            swap(a[j],a[i + 1]);
            i += 1;
        }
    }
    swap(a[i + 1], a[r]);
    return i + 1;
}
void myQuickSort(int l, int r){
    if(l >= r){
        return;
    }
    int position = myPartition(l,r);
    myQuickSort(l, position - 1);
    myQuickSort(position + 1, r);
}
int main()
{
    f >> n;
    for(int i = 1; i <= n; ++i){
        f >> a[i];
    }
    myQuickSort(1, n);
    for(int i = 1; i <= n; ++i){
        g << a[i] << ' ';
    }
    return 0;
}