#include <bits/stdc++.h>
using namespace std;
long long bina[100005], k = 1, arr[100005], ans[100005];
long long solve(long long s, long long l, long long a, long long idx) {
  long long mid;
  while (s < l) {
    mid = (l + s) / 2;
    if (arr[bina[mid]] < a) {
      l = mid;
    } else {
      s = mid + 1;
    }
  }
  if (arr[bina[s]] >= a) return -1;
  return bina[s] - idx - 1;
}
int main() {
  long long i, n;
  scanf("%lld", &n);
  for (i = 1; i <= n; i++) {
    scanf("%lld", &arr[i]);
  }
  ans[n] = -1;
  bina[1] = n;
  for (i = n - 1; i >= 1; i--) {
    ans[i] = solve(1, k, arr[i], i);
    if (arr[i] < arr[bina[k]]) {
      k++;
      bina[k] = i;
    }
  }
  for (i = 1; i <= n; i++) {
    cout << ans[i] << " ";
  }
  return 0;
}
