#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t n;
    cin >> n;
    vector<int32_t> as(n);
    for (auto i = 0; i < n; ++i) {
        cin >> as[i];
    }
    for (auto i = 1; i < 2 * n - 3; ++i) {
        for (auto p = 0; p <= n - 1; ++p) {
            auto q = i - p;
            if (!(0 <= q && q <= n - 1 && p < q))
                continue;
            if (as[p] > as[q])
                swap(as[p], as[q]);
        }
    }
    for (auto i = 0; i < n; ++i) {
        cout << as[i] << (i == n - 1 ? '\n' : ' ');
    }
    return 0;
}