#include <fstream>
using namespace std;

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

int n, v[30000];
int tree[120000];


void Update(int pos, int val, int node = 1, int l = 1, int r = n) {
    if (l == r) {
        tree[node] = val;
        return;
    }

    int mid = (l + r) / 2;

    if (pos <= mid) {
        Update(pos, val, node * 2, l, mid);
    } else {
        Update(pos, val, node * 2 + 1, mid + 1, r);
    }

    tree[node] = tree[node * 2] + tree[node * 2 + 1];
}

int Query(int kth, int node = 1, int l = 1, int r = n) {
    if (l == r) return l;

    int mid = (l + r) / 2;

    if (tree[node * 2] >= kth) {
        return Query(kth, node * 2, l, mid);
    } else {
        return Query(kth - tree[node * 2], node * 2 + 1, mid + 1, r);
    }
}


int main()
{
    int order[30001];

    in >> n;

    for (int i = 1; i <= n; ++i) {
        in >> v[i - 1];
        Update(i, 1);
    }

    for (int i = n; i >= 1; --i) {
        int pos = Query(v[i - 1]);
        order[pos] = i;
        Update(pos, 0);
    }

    for (int i = 1; i <= n; ++i) {
        out << order[i] << "\n";
    }

    return 0;
}