#include <fstream>

using namespace std;

const int NMAX = 30001;

class InParser
{
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch()
    {
        ++sp;
        if(sp == 4096)
        {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume)
    {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n)
    {
        char c;
        while(!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if(c == '-')
        {
            n = 0;
            sgn = -1;
        }
        else
        {
            n = c - '0';
        }
        while(isdigit(c = read_ch()))
        {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};

class OutParser
{
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch)
    {
        if(sp == 50000)
        {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        }
        else
        {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name)
    {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser()
    {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32)
    {
        if(vu32 <= 9)
        {
            write_ch(vu32 + '0');
        }
        else
        {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch)
    {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch)
    {
        while(*ch)
        {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

InParser fin("schi.in");
OutParser fout("schi.out");

int n, aib[NMAX], v[NMAX], sol[NMAX];

void add(int poz, int val)
{
    while(poz <= n)
    {
        aib[poz] += val;
        poz += poz & (-poz);
    }
}

int sum(int poz)
{
    int s = 0;
    while(poz)
    {
        s += aib[poz];
        poz -= poz & (-poz);
    }
    return s;
}

int cb(int x)
{
    int st = 1, dr = n, poz, mij;
    while(st <= dr)
    {
        mij = (st + dr) / 2;
        if(sum(mij) < x) st = mij + 1;
        else dr = mij - 1, poz = mij;
    }
    return poz;
}

int main()
{
    fin >> n;
    for(int i = 1; i <= n; ++i) fin >> v[i], add(i, 1);
    for(int i = n; i > 0; --i)
    {
        int poz = cb(v[i]);
        sol[poz] = i;
        add(poz, -1);
    }
    for(int i = 1; i <= n; ++i) fout << sol[i] << '\n';
    return 0;
}