#include <bits/stdc++.h>
using namespace std;
const int N = 100100;
const long long inf = 1e9;
int n;
int a[N], ans[N];
void solve(int p) {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<pair<int, int> > v;
  for (int i = n - 1; i >= 0; i--) {
    if (i == n - 1) {
      ans[i] = -1;
      v.push_back({a[i], i});
      continue;
    }
    int m = v.size();
    if (a[i] < v[m - 1].first) {
      v.push_back({a[i], i});
      ans[i] = -1;
      continue;
    }
    int mid, l = 0, r = m - 1, a1 = -1;
    while (l <= r) {
      mid = (l + r) / 2;
      if (v[mid].first >= a[i])
        l = mid + 1;
      else if (v[mid].first < a[i]) {
        r = mid - 1;
        a1 = v[mid].second - i - 1;
      }
    }
    ans[i] = a1;
  }
  for (int i = 0; i < n; i++) {
    cout << ans[i] << " ";
  }
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t, p;
  t = 1;
  for (p = 1; p <= t; p++) {
    solve(p);
  }
  return 0;
}
