#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const int N = 100000 + 5;
const int MAX = 2147483647;
int prime[25] = {2,  3,  5,  7,  11, 13, 17, 19, 23, 29, 31, 37, 41,
                 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
pair<int, int> p[N];
stack<int> s;
int ans[N];
int n;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &p[i].first);
    p[i].second = i;
  }
  sort(p + 1, p + 1 + n);
  memset(ans, 0, sizeof(ans));
  for (int i = 1; i <= n; i++) {
    int b = max(b, p[i].second);
    ans[p[i].second] = max(0, b - p[i].second);
  }
  for (int i = 1; i <= n; i++) {
    printf("%d ", ans[i] - 1);
  }
  printf("\n");
  return 0;
}
