#include <stdio.h>
#define NMAX 30000
FILE *fin, *fout;
int n, arb[4*NMAX+23], v[NMAX+23], v2[NMAX+23];
void pun(int st, int dr, int pos, int nod)
{
    if(st == dr)
    {
        arb[nod] = 1;
        return;
    }
    int mij = (st+dr)/2;
    if(pos <=  mij) pun(st, mij, pos, 2*nod);
    if(pos > mij) pun(mij+1, dr, pos, 2*nod+1);
    arb[nod] = arb[2*nod] + arb[2*nod+1];
    return;
}
int interogare(int st, int dr, int st1, int dr1, int nod)
{
    if(st == st1 && dr == dr1) return arb[nod];
    int mij = (st+dr)/2;
    if(st1 > mij) return interogare(mij+1, dr, st1, dr1, 2*nod+1);
    if(dr1 <= mij) return interogare(st, mij, st1, dr1, 2*nod);
    return interogare(st, mij, st1, mij, 2*nod) + interogare(mij+1, dr, mij+1, dr1, 2*nod+1);
}
int main()
{
    fin = fopen("schi.in", "r");
    fout = fopen("schi.out", "w");
    fscanf(fin, "%d", &n);
    for(int i = 0; i< n; i++) fscanf(fin, "%d", &v[i]);
    for(int i = n-1; i>=0; i--)
    {
        int temp = v[i], temp1;
        while(1)
        {
            temp1 = temp;
            temp=interogare(1, n, 1, temp, 1) + v[i];
            if(temp == temp1) break;
        }
        pun(1, n, temp, 1);
        v2[temp] = i+1;
    }
    for(int i = 1; i<= n; i++) fprintf(fout, "%d\n", v2[i]);
    fclose(fin);
    fclose(fout);
    return 0;
}