#include <bits/stdc++.h>
using namespace std;
#define LL __int128
#define ll long long
#define uLL __uint128_t
#define ull unsigned long long
#define REP(i, l, r) for(int i = l; i <= r; ++i)
#define PER(i, r, l) for(int i = r; i >= l; --i)
namespace ink {
	const int N = 2e5 + 5;
	int n;
	int a[N];
	int b[5], c[5];
	void CMP(int *A, int *B, int sz) {

		REP(i, 1, sz) {
			if(A[i] != B[i]){
				if(B[i] < A[i]) {
					REP(j, 1, sz) A[j] = B[j];
					return;
				}
				else return;
			}
		}
	}
	void cmp(int *b, int x, int y,int z) {
		c[1] = x, c[2] = y, c[3] = z;
		CMP(b, c, 3);
	}
	int g[N], O[N];
	int main() {
		ios::sync_with_stdio(false);
		cin.tie(0), cout.tie(0);
		cin >> n;
		REP(i, 1, n) cin >> a[i], O[i] = a[i];
		int i = 1;
		for(i = 1; i <= n - 1; i += 2) {
			int x = a[(i + 1) / 2];
			int y = a[i + 1];
			int z = a[i + 2];
			b[1] = x,b[2] = y,b[3] = z;
			cmp(b, z, y, x);
			cmp(b, y, x, z);
			cmp(b, z, x, y);
			// cout << b[1] << ' ' << b[2] << ' ' << b[3] << '\n';
			a[(i + 1) / 2] = b[1], a[i + 1] = b[2], a[i + 2] = b[3];
		}
		for(; i <= n - 1; ++i) {
			if(a[(i + 1) / 2] > a[i + 1])swap(a[(i + 1) / 2], a[i + 1]);
		}
		REP(s, 1, (1 << (n - 1)) - 1) {
			REP(i, 1, n) g[i] = O[i];
			REP(i, 1, n - 1) {
				if(s >> (i - 1) & 1) swap(g[(i + 1) / 2], g[i + 1]);
			}
			CMP(a, g, n);
		}
		REP(i, 1, n) cout << a[i] << " \n"[i == n];
		return 0;
	}
}

signed main() {return ink::main();}