#include <bits/stdc++.h>

#if 1
#define pv(x) cout<<#x<<" = "<<x<<"; ";cout.flush()
#define pn cout<<endl
#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 uint = unsigned int;
#define pb push_back
#define mp make_pair
const int NMax = 5e5 + 5;
const int inf = 1e9 + 5;
using zint = int;

int N,M;
int v[NMax];

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

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

    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 i,j;
    part(st,dr,i,j);
    solve(st,i-1);
    solve(j+1,dr);
}

int part(int st,int dr,int& i,int& j) {
    int idx = rand() % (dr-st+1) + st;
    int pivot = v[idx];

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

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

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