#include <iostream>
#include<vector>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<map>
#include<set>
using namespace std;
int main (void) {
    long long int j,n,num;
    cin >> n;
    vector<long long int> a(n);
    for(long long int i=0;i<n;i++)    cin >> a[i];
    for(long long int x=1;x<2*n-3;x++){
        for(long long int i=0;i<n/2;i++){
            j = n-i;
            if(a[j]+a[i]==x&&a[i]>a[j]) swap(a[i],a[j]);
            
        }
    }
    for(long long int i=0;i<n;i++)    cout << a[i] << " ";
    cout << endl;
    return 0;
}