#include <bits/stdc++.h>
#define int long long
using namespace std;

signed main() {
	int n, l; cin >> n;
	vector<pair<int, int>> v(n);
	vector<int> res(n);
	for (int i = 0; i < n; i++) {
		scanf("%lld", &v[i].first);
		v[i].second = i;
	}
	sort(v.begin(), v.end());
	res[v[n - 1].second] = 0;
	l = n - 1;
	for (int i = n - 2; i >= 0; i--) {
		if (l < n - 1 && v[l].first == v[l + 1].first)
			l++;
		if (v[i].first < v[i + 1].first)
			l = i + 1;
		res[v[i].second] = v[l].second + 1;
	}
	for (int i = 0; i < n; i++)
		cout << res[i] << ' ';
	return 0;
}
// 0 0 1 2 3
// 2 1 1 0 0
// 0 0 0 0 0