#include <iostream>
#include <fstream>
#include <cstdlib>
#include <vector>
#include <stack>
#include <time.h>
#include <cstdlib>
#include <algorithm>

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

#define ll long long
#define ull unsigned long long
#define pb push_back
const ll inf = 1e18 + 5;
const int NMax = 5e5 + 5;

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) {
    int idx = rand() % (dr-st+1) + st;
    swap(v[st],v[idx]);
    int pivot = v[st];

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

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

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