#include "bits/stdc++.h" #include #define _CRT_SECURE_NO_WARNINGS #define REP(i, n) for(decltype(n) i = 0; i < (n); i++) #define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++) #define ALL(a) (a).begin(),(a).end() #define SORT(c) sort((c).begin(),(c).end()) #define DESCSORT(c) sort(c.begin(), c.end(), greater()) using namespace std; using LL = long long int; using LD = long double; using pii = pair; using pll = pair; using pdd = pair; using vi = vector; using vvi = vector; using vvvi = vector; using vl = vector; using vvl = vector; using vvvl = vector; using vd = vector; using vvd = vector; using vs = vector; using vb = vector; using vvb = vector; const int INF = (1 << 30) - 1; const LL INF64 = ((LL)1 << 62) - 1; const double PI = 3.1415926535897932384626433832795; const int dy[] = { 0, 1, 0, -1 }; const int dx[] = { 1, 0, -1, 0 }; int gcd(int x, int y) { return y ? gcd(y, x % y) : x; } LL gcd(LL x, LL y) { return y ? gcd(y, x % y) : x; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vi a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < 2 * n - 3; i++) { for (int j = 0; j <= i; j++) { int p = j; int q = i - p; if (p < 0 || q < 0 || p >= n || q >= n) { continue; } if (p + q != i) { continue; } if (a[p] < a[q]) { swap(a[p], a[q]); } } } for (int i = 0; i < n; i++) { if (i) cout << " "; cout << a[i]; } cout << endl; return 0; }