#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>

#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define REP(i,a,n) for(int i = (a);i < (n);i++)
#define PI 3.14159265359
#define MOD 1000000007

using namespace std;

int main(){
    int n;
    cin >> n;
    vector<int> a(n);
    REP(i, 0, n){
        cin >> a[i];
    }
    
    REP(i, 1, 2*n-3){
        REP(p, 0, i){
            int q = i-p;
            if(p < q && q <= n-1){
                if(a[p] > a[q])swap(a[p], a[q]);
            }
        }
    }
    REP(i, 0, n)printf("%d ",a[i]);
    cout << endl;
    return 0;
}