#include <bits/stdc++.h>

#define vt vector
#define pb push_back
#define em emplace
#define emb emplace_back

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

void re() {
}

void wr() {
}

template <typename fir, typename ...sec> void re(fir &x, sec&... y) {
    cin >> x;
    re(y...);
}

template <typename fir, typename ...sec> void wr(fir x, sec... y) {
    cout << x;
    wr(y...);
}

inline void Open(const string Name) {
    #ifndef ONLINE_JUDGE
        (void)!freopen((Name + ".in").c_str(), "r", stdin);
        (void)!freopen((Name + ".out").c_str(), "w", stdout);
    #endif

}

void solve() {
    int n; re(n);
    vt <int> v(n + 1);
    for(int i = 1;i <= n;i++)
        re(v[i]);

    auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
    mt19937 mt(seed);    
    auto qsort = [&](auto&& qsort, int l, int r, vt <int>& v) -> void {
        if(l >= r) {
            return;
        }

        uniform_int_distribution<> distr(l, r);
        int val = v[distr(mt)], i = l, j = r;
        while(i <= j) {
            while(val > v[i]) i++;
            while(val < v[j]) j--;
            if(i <= j) {
                swap(v[i++], v[j--]);
            }
        }

        qsort(qsort, l, j, v);
        qsort(qsort, i, r, v);
    };

    qsort(qsort, 1, n, v);
    for(int i = 1;i <= n;i++)
        wr(v[i], ' ');
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    Open("algsort");

    int t = 1;
    for(;t;t--) {
        solve();
    }

    return 0;
}