#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cstring>

using namespace std;

#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define REP(i,n) FOR(i,0,n)

typedef long long ll;

ll a[5001];

int main(){
	int n;
	
	cin >> n;
	
	REP(i,n) scanf("%lld", &a[i]);
	
	FOR(i,1,2*n-3){
		REP(p,n){
			REP(q,n){
				if (p+q == i){
					if (a[p] > a[q]){
						int tmp = a[p];
						a[p] = a[q];
						a[q] = a[p];
					}
				}
			}
		}
	}
	
	REP(i,n){
		printf("%lld", a[i]);
		if (i != n-1) printf(" ");
		else puts("");
	}
	
	return 0;
}