#include <bits/stdc++.h>
using namespace std;
int many;
int s[100010];
int a[100010];
int p[100010];
int run(int o) {
  int zuo = 1;
  int you = o - 1;
  int re = -1;
  int k;
  while (zuo <= you) {
    k = (zuo + you) / 2;
    if (a[k] < s[o]) {
      re = k;
      you = k - 1;
    } else
      zuo = k + 1;
  }
  return re;
}
int main() {
  cin >> many;
  for (int i = 1; i <= many; i++) scanf("%d", &s[many + 1 - i]);
  a[1] = s[1];
  p[1] = -1;
  for (int i = 2; i <= many; i++) a[i] = min(a[i - 1], s[i]);
  for (int i = 2; i <= many; i++) {
    if (a[i - 1] >= s[i])
      p[i] = -1;
    else
      p[i] = i - 1 - run(i);
  }
  for (int i = 1; i <= many; i++) printf("%d ", p[many + 1 - i]);
  return 0;
}
