#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 msort = [&](auto&& msort, int l, int r, vt <int>& v) -> void {
        if(l >= r) {
            return;
        }

        int m = (l + r) / 2;
        vt <int> a(r - l + 2);

        msort(msort, l, m, v);
        msort(msort, m + 1, r, v);

        int i = l, j = m + 1, idx = 0;
        while(i <= m && j <= r) {
            if(v[i] > v[j]) {
                a[++idx] = v[j++];
            } else {
                a[++idx] = v[i++];
            }
            while(j <= r && i > m) a[++idx] = v[j++];
            while(i <= m && j > r) a[++idx] = v[i++];
        }
        for(int i = l, j = 1;i <= r;i++)
            v[i] = a[j++];
    };

    msort(msort, 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;
}