#include <fstream>
#include <map>
#include <vector>
#include <string>
#include <algorithm>
#include <sstream>

using namespace std;

int main()
{
	ifstream cin("schi.in");
	ofstream cout("schi.out");
	int n;
	cin >> n;
	vector<int> p(n);
	vector<int> ret(n);
	for (int i = 0; i < n; i++) {
		cin >> p[i];
	}

	for (int i = n - 1; i >= 0; i--) {
		
		for (int j = i + 1; j < n; j++) {
			if (p[j] <= p[i] + ret[i]) {
				ret[i]++;
			}
		}
		
	}

	vector< pair<int, int> > sol;

	for (int i = 0; i < n; i++) {
	//	cout << ret[i] + p[i] << "\n";
		sol.push_back({ ret[i] + p[i], i + 1 });
	}

	sort(sol.begin(), sol.end());

	for (int i = 0; i < n; i++) {
		cout << sol[i].second << "\n";
	}

	return 0;
}