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

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

#define MAX 30005
int n, final_ranking[MAX];
int AIB[MAX];  // tii minte cate locuri libere sunt in grupa fiecarui element.

void gen_AIB() {
    fin >> n;

    int pow2 = 1;

    while (pow2 <= n) {
        for (int i = pow2; i <= n; i += 2 * pow2) {
            for (int j = i - 1; j > i - pow2; j -= j & (-j)) {
                AIB[i] += AIB[j];
            }

            AIB[i]++;
        }

        pow2 *= 2;
    }
}

void update(int poz, int val) {
    for (int i = poz; i <= n; i += i & (-i)) {
        AIB[i] += val;
    }
}

int query_sum(int poz) {
    int sum = 0;

    for (int i = poz; i > 0; i -= i & (-i)) {
        sum += AIB[i];
    }

    return sum;
}

int findPos(int poz) {
    int sol = 0;

    for (int pas = 1 << 20; pas > 0; pas /= 2) {
        if (sol + pas <= n && query_sum(sol + pas - 1) < poz) {
            sol += pas;
        }
    }

    return sol;
}

int main() {
    gen_AIB();
    int poz;
    stack<int> temp_ranking;

    for (int i = 1; i <= n; i++) {
        fin >> poz;
        temp_ranking.push(poz);
    }

    while (!temp_ranking.empty()) {
        int wanted_poz = temp_ranking.top();
        int found_poz = findPos(wanted_poz);
        update(found_poz, -1);

        final_ranking[found_poz] = temp_ranking.size();
        temp_ranking.pop();
    }

    for (int i = 1; i <= n; i++) {
        fout << final_ranking[i] << '\n';
    }

    return 0;
}