#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int a[100010];
  int i, j;
  vector<pair<int, int> > v;
  for (i = 0; i < n; i++) {
    cin >> a[i];
    v.push_back(make_pair(a[i], i));
  }
  sort(v.begin(), v.end());
  int b[100010];
  int pre = -1;
  for (i = 0; i < n; i++) {
    int p = v[i].second;
    b[p] = pre > p ? (pre - p - 1) : -1;
    if (p > pre) pre = v[i].second;
  }
  for (i = 0; i < n; i++) cout << b[i] << " ";
  cout << endl;
  return 0;
}
