#include <bits/stdc++.h>
using namespace std;

using ii = pair<int, int>;

vector<ii> min_shooting_buildings(vector<int> A){
	if ((int)A.size() == 0) return {};
	if ((int)A.size() == 1) return {{A[0], A[0]}};

	int n = A.size();

	vector<int> bad, good;
	int mx = -1;
	for (int i = 0; i < n; i++){
		if (i < n-1 && A[i] >= A[i+1]){
			if (A[i] > mx) bad.push_back(i);
		}
		else{
			if (A[i] > mx) good.push_back(i);
		}
		mx = max(mx, A[i]);
	}

	bad.insert(bad.end(), good.begin(), good.end());

	ii val;
	if ((int)bad.size() >= 2) val = {bad[0], bad[1]};
	else val = {bad[0], bad[0]};

	vector<int> newA;
	for (int i = 0; i < n; i++){
		if (i == val.first || i == val.second) continue;
		newA.push_back(A[i]);
	}

	ii yval = {A[val.first], A[val.second]};
	vector<ii> recur = min_shooting_buildings(newA);

	vector<ii> res = {yval};
	res.insert(res.end(), recur.begin(), recur.end());

	return res;
}