#include <fstream>
using namespace std;
ifstream cin("schi.in");
ofstream cout("schi.out");
int n, m, cit[30002], aib[30002], ans[30002];
void build(int pos, int val) {
	while (pos <= n) {
		aib[pos] += val;
		pos += (pos & -pos);
	}
}
int query(int pos) {
	int ans = 0;
	while (pos > 0) {
		ans += aib[pos];
		pos -= (pos & -pos);
	}
	return ans;

}
int bin(int pos) {
	int st = 1;
	int dr = n;
	while (st <= dr) {
		int mid = st + dr;
		mid /= 2;
		if (query(mid) < pos) {
			st = mid + 1;
		}
		else {
			dr = mid - 1;
		}
		if (query(st) == pos) {
			return st;
		}
	}
}
int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> cit[i];
	}
	for (int i = 1; i <= n; i++) {
		build(i, 1);
	}
	for (int i = n; i >= 1; i--) {
		ans[bin(cit[i])] = i;
		build(bin(cit[i]), -1);
	}
	for (int i = 1; i <= n; i++) {
		cout << ans[i] << '\n';
	}
}