#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (b < a) {
    long long int temp = a;
    a = b;
    b = temp;
  }
  if (a == 0) {
    return b;
  }
  return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
  return (a * b / gcd(a, b));
}
long long int fact(long long int x) {
  long long int ans = 1;
  if (x == 0) {
    return 1;
  }
  while (x > 0) {
    ans = (ans * x) % 1000000007;
    x--;
  }
  return ans % 1000000007;
}
long long int power(long long int a, long long int b) {
  long long int ans = 1;
  while (b > 0) {
    if (b % 2 == 1) {
      ans *= a;
      ans = ans;
    }
    b /= 2;
    a *= a;
    a = a;
  }
  return ans;
}
vector<long long int> getbinary(int x) {
  vector<long long int> bin(10, 0);
  long long int iter = 0;
  while (x > 0) {
    if (x % 2 == 1) {
      bin[iter] = 1;
    } else {
      bin[iter] = 0;
    }
    iter++;
    x /= 2;
  }
  return bin;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, x = 0, i;
  cin >> n;
  pair<long long int, long long int> a[n];
  long long int b[n];
  for (i = 0; i < n; i++) {
    b[i] = 0;
    cin >> a[i].first;
    a[i].second = i;
  }
  sort(a, a + n);
  x = a[0].second;
  b[a[0].second] = -1;
  for (i = 1; i < n; i++) {
    if (a[i].second > x) {
      b[a[i].second] = -1;
      x = a[i].second;
    } else {
      b[a[i].second] = x - a[i].second - 1;
    }
  }
  for (i = 0; i < n; i++) {
    cout << b[i] << endl;
  }
}
