#include <bits/stdc++.h>

using namespace std;

#if 1
    #define pv(x) cout<<#x<<" = "<<x<<"; ";cout.flush()
    #define pn cout<<endl
#else
    #define pv(x)
    #define pn
#endif

#ifdef ONLINE_JUDGE
    #define in cin
    #define out cout
#else
    ifstream in("algsort.in");
    ofstream out("algsort.out");
#endif

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_ll = 1e18 + 5;
const int inf_int = 1e9 + 5;
const int mod = 100003;
using zint = int;

int N;
int v[NMax];


void part(int st,int dr,int& i,int& j) {
    int pivot = v[ rand() % (dr - st + 1) + st ];
    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 {
            return;
        }
    }
}

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 main() {
    in.sync_with_stdio(false);
    in.tie(0);
    out.tie(0);
    out.sync_with_stdio(false);

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

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

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

    return 0;
}