#include<bits/stdc++.h>
using namespace std;
#define maxn 100860
int ans[maxn];
int n,a[maxn];
int que[maxn];
int head,tail;
int main()
{
    head=1;
    scanf("%d",&n);
    for(int i=1; i<=n; i++)
        scanf("%d",&a[i]);
    for(int i=n; i>=1; i--)
    {
        if(head>tail||(head<=tail&&a[que[tail]]>=a[i]))
        {
            ans[i]=-1;
            que[++tail]=i;
        }
        else
        {
            int l=head,r=tail;
            while(l<r)
            {
                int mid=(l+r)>>1;
                if(a[que[mid]]<a[i])r=mid;
                else l=mid+1;
            }
            ans[i]=que[l]-i-1;
        }
    }
    for(int i=1; i<n; i++)
        printf("%d ",ans[i]);
    printf("%d\n",ans[n]);
    return 0;
}