#include <fstream>

using namespace std;

ifstream fin("data.in");
ofstream fout("data.out");

#define MAXN 30001
int T[4 * MAXN + 10], a = 1, b, p[MAXN], v[MAXN], N, pos, sum;

void update(int node, int l, int r)
{
	if (a <= l && r <= b){
		b += T[node];
		if (l == r) T[node] = 1;
		return;
	}
	int mid = (l + r) / 2;
	if (a <= mid) update(node * 2, l, mid);
	if (b >= mid + 1) update(node * 2 + 1, mid + 1, r);
	T[node] = T[node * 2] + T[node * 2 + 1];
}

int main()
{
	fin >> N;
	for (int i = 1; i <= N; ++i)  fin >> v[i];
	for (int i = N; i > 0; --i){
		b = v[i];
		update(1, 1, N);
		p[b] = i;
	}
	for (int i = 1; i <= N; ++i)
		fout << p[i] << "\n";

	fin.close();
	fout.close();
	return 0;
}