#include <bits/stdc++.h>

#if 0
#define pv(x) cout<<#x<<" = "<<x<<"; "
#define pn cout<<"\n"
#else
#define pv(x)
#define pn
#endif

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

using ll = long long;
using ull = unsigned long long;
using ui = unsigned int;
#define pb push_back
#define mp make_pair
const int NMax = 5e5 + 5;
const ll inf = 1e18 + 5;
const int mod = 100003;
using zint = int;

int N;
int v[NMax];

void solve(int,int);
int part(int,int);

int main() {
    in>>N;
    for (int i=1;i <= N;++i) {
        in>>v[i];
    }

    srand(time(0));
    solve(1,N);

    for (int i=1;i <= N;++i) {
        out<<v[i]<<' ';
    }

    in.close();out.close();
    return 0;
}

void solve(int st,int dr) {
    if (st >= dr) {
        return;
    }

    int idx = part(st,dr);
    solve(st,idx);
    solve(idx+1,dr);
}

int part(int st,int dr) {
    swap(v[st],v[rand()%(dr-st+1) + st]);

    int pivot = v[st];
    int i = st-1,j = dr+1;
    while (true) {
        do {
            ++i;
        }
        while (v[i] < pivot);

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

        if (i > j) {
            return j;
        }
        else {
            swap(v[i],v[j]);
        }
    }

    swap(v[++i],v[dr]);

    return i;
}