#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
const int N = 500002;
int v[N];
int pivot(int st, int dr){
    int x = v[dr], i = st - 1, j;
    for(j=st;j<dr;j++)
        if(v[j] <= x)
            swap(v[j],v[++i]);
    swap(v[dr],v[i+1]);
    return i+1;
}
void quickSort(int st, int dr){
    if(dr <= st)
        return ;
    int p = pivot(st,dr);
    quickSort(st,p-1);
    quickSort(p+1,dr);
}
int main()
{
    int n;
    in>>n;
    for(int i=1;i<=n;i++)
        in>>v[i];
    in.close();
    quickSort(1,n);
    for(int i=1;i<=n;i++)
        out<<v[i]<<" ";
    out.close();
    return 0;
}