#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#define rep(i,a,b) for(int (i)=(a);i<(b);i++)
#define INF 100000000
using namespace std;

int main(){
    int n,a[5010];
    cin>>n;
    rep(i,0,n)cin>>a[i];
    
    rep(i,1,2*n-2){
        rep(j,0,n){
            rep(k,0,n){
                if(j+k==i&&a[j]<a[k])swap(a[j],a[k]);
            }
        }
    }
    
    rep(i,0,n)cout<<a[i]<<" ";
    return 0;
    
}