#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000 + 10;
int n;
pair<int, int> P[MAXN];
int res[MAXN];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &P[i].first);
    P[i].second = i;
  }
  sort(P, P + n);
  int Max = -1;
  for (int i = 0; i < n; i++) {
    res[P[i].second] = max(0, Max - P[i].second);
    Max = max(Max, P[i].second);
  }
  for (int i = 0; i < n; i++) printf("%d ", res[i] - 1);
  printf("\n");
  return 0;
}
