#include <cstdio>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <map>
using namespace std;
int n,a[1000010],f[1000010],h[1000010],now=0;
int main(){
	freopen("lookup.in","r",stdin);
	freopen("lookup.out","w",stdout);	
	cin>>n;
	now=n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	h[0]=0,h[1]=0,a[0]=1000100;
	for(int i=n;i>=1;i--){
		while(a[i]>=a[h[now]]){
			h[now]=0;
			now--;
		}
		f[i]=h[now];
		h[++now]=i;
	}
	for(int i=1;i<=n;i++){
		cout<<f[i]<<endl;
	}
	return 0;
}