#pragma GCC optimize("O2")

#include <iostream>
#include <fstream>

std::ifstream in(static_cast<const char*>("algsort.in"));
std::ofstream out(static_cast<const char*>("algsort.out"));

constexpr std::size_t mod = static_cast<std::size_t>(1ull << 32);
constexpr std::size_t mul = static_cast<std::size_t>(1664525);
constexpr std::size_t inc = static_cast<std::size_t>(1013904223);
std::size_t stt = 0;

static inline std::size_t _int() {
    return (stt = (mul * stt + inc) % mod);
}

constexpr std::size_t nmax = 500005;

std::size_t n, v[nmax];

static inline std::size_t partition(const std::size_t& s, const std::size_t& d) {
    const std::size_t& pivot = v[d];
    std::size_t i = s - 1, j;
    for(j = s; j < d; ++j) {
        if(v[j] < pivot) {
            ++i; std::swap(v[i], v[j]);
        }
    }
    std::swap(v[i + 1], v[d]);
    return i + 1;
}

static inline void sort(const std::size_t& s, const std::size_t& d) {
    if(s >= d) return;

    const std::size_t pz = s + (_int() % (d - s));
    std::swap(v[pz], v[d]);
    const std::size_t p = partition(s, d);
    sort(s, p - 1);
    sort(p + 1, d);
}

int main(void) {
    std::ios::sync_with_stdio(false);
    in.tie(nullptr);
    out.tie(nullptr);

    in >> n;
    for(std::size_t i = 1; i <= n; ++i) in >> v[i];
    sort(1, n);
    for(std::size_t i = 1; i <= n; ++i) out << v[i] << ' ';

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