#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int a[N],p[N];
stack<int>stk;
int main()
{
    int n;scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	for(int i=n;i>=1;i--)
	{
		while( !stk.empty() && a[i]>=a[stk.top()] ) stk.pop();
		p[i]=stk.empty() ? 0 : stk.top();
		stk.push(i);
	}
    for(int i=1;i<=n;i++)printf("%d\n",p[i]);
    return 0;
}