#include <iostream>
#include <vector>
#include <queue>
using namespace std;

int n;
vector <int> a;
deque <int> Q;

int main()
{
	cin >> n;
	a = vector <int> (n + 1);

	for (int i = 1; i <= n; ++i)
	{
		cin >> a[i];
		Q.push_back(a[i]);
		while (!Q.empty() && a[i] > a[Q.back()])
		{
			Q.push_back(a[i]);
		}


	}

}