#include <iostream>
#include <fstream>
using namespace std;

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

int n, v[30001];
int *tree;


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 a, int b, int node = 1, int l = 1, int r = n) {
    if (l > b || r < a) return 0;
    if (l >= a && r <= b) return tree[node];

    int mid = (l + r) / 2;
    int left_child = Query(a, b, node * 2, l, mid);
    int right_child = Query(a, b, node * 2 + 1, mid + 1, r);
    return left_child + right_child;
}

int find(int val) {
    int l = 0, r = n, mid;
    int pos = 0;
    while (l < r) {
        mid = (l + r) / 2;
        if (Query(1, mid) < val) {
            l = mid + 1;
            pos = mid;
        } else {
            r = mid;
        }
    }
    return pos;
}


int main()
{
    int order[30001];

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

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

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

    return 0;
}