#include<iostream>
#include<algorithm>
#include <vector>
#include<cmath>
#include<iomanip>
#include<queue>
using namespace std;
typedef long long int lint;
int main() {
	int n;
	cin >> n;
	vector<int>vec(n);
	for (int ia = 0; ia < n; ia++) {
		cin >> vec.at(ia);
	}
	for (int ib = 1; ib < 2 * n - 3; ib++) {
		for (int ic = 0; ic <= ib; ic++) {
			if (0 <= ib && ib < n && 0 <= ic && ic < n) {
				vec.at(min(ic,ib-ic)) = min(vec.at(ic), vec.at(ib - ic));
				vec.at(max(ic,ib - ic)) = max(vec.at(ic), vec.at(ib - ic));
			}
		}
	}
	for (int id = 0; id < n; id++) {
		cout << vec.at(id) << ' ';
	}
	cout << endl;
}