#include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
#include <queue>
#include <map>
#include <list>
#include <fstream>
using namespace std;

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

int main() {
    int n;
    fin >> n;
    list<int> ans;
    for (int i = 1; i <= n; ++i) {
        int rank;
        fin >> rank;
        list<int>::iterator it = ans.begin();
        while (rank) {
            ++it;
            --rank;
        }
        --it;
        ans.insert(it, i);
    }
    for (list<int>::iterator it = ans.begin(); it != ans.end(); ++it) {
        fout << *it << '\n';
    }
    return 0;
}