#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
void solve() {
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (long long i = 0; i < n; ++i) cin >> a[i];
  vector<long long> mn(n);
  mn[n - 1] = a[n - 1];
  for (long long i = n - 2; i >= 0; --i) mn[i] = min(a[i], mn[i + 1]);
  vector<long long> ans(n);
  ;
  ;
  for (long long i = 0; i < n; ++i) {
    auto it = lower_bound(mn.begin() + i, mn.end(), a[i]);
    if (it == mn.begin()) {
      ans[i] = -1;
      continue;
    }
    --it;
    if (*it == a[i]) {
      if (it == mn.begin()) {
        ans[i] = -1;
        continue;
      }
      --it;
    }
    if (*it >= a[i]) {
      ;
      ans[i] = -1;
    } else {
      long long id = it - mn.begin();
      ans[i] = id - i - 1;
    }
  }
  for (long long i = 0; i < n; ++i) cout << max(ans[i], -1LL) << " ";
  cout << '\n';
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long t;
  t = 1;
  while (t--) solve();
}
