#include <bits/stdc++.h>
using namespace std;
long long ans[1000001], i, n, k, a;
pair<long long, long long> p[1000001];
int main() {
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> a;
    p[i].first = a;
    p[i].second = i;
  }
  sort(p + 1, p + n + 1);
  for (i = 1; i <= n; i++) {
    if (p[i].second > k) {
      k = p[i].second - 1;
      ans[p[i].second] = -1;
    } else {
      ans[p[i].second] = k - p[i].second;
    }
  }
  for (i = 1; i <= n; i++) cout << ans[i] << " ";
}
