#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

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

    srep(i,1,n*2-3){
        drep(p, n-2){
            int q = i - p;
            if(q <= p || n <= q)continue;
            if(a[p] > a[q])swap(a[p], a[q]);
        }
    }

    rep(i,n)cout << a[i] << ' ';
    cout << endl;
    return 0;
}