#include <bits/stdc++.h>

#define REP(i, x, n) for (int i = x; i < (int)(n); i++)
#define rep(i, n) REP (i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x.size())
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define uniq(x) x.erase(unique(x.begin(), x.end()), x.end())
#define F first
#define S second
#define mp make_pair
#define eb emplace_back

using namespace std;

typedef long long ll;

const int INF = 1 << 29;

int main() {
    int n;
    cin >> n;
    int a[n];
    rep (i, n) cin >> a[i];

    rep (i, n) REP (j, i + 1, n) if (i + j < 2 * n - 3) {
        if (a[i] > a[j]) swap(a[i], a[j]);
    }

    rep (i, n) {
        if (i) cout << ' ';
        cout << a[i];
    }
    cout << endl;
}