#include <fstream>


int n;
int tree[120004];
int clasament[30001];
int result[30001];




void modify(int node, int left, int right, int position, int value)
{

        if (left==right)
        {
                tree[node] = value;
                return;
        }
        int middle = (left+right)>>1;
        if (position <= middle)
                modify(node<<1, left, middle, position, value);
        else
                modify(node<<1|1, middle+1, right, position, value);
        tree[node] = tree[node<<1] + tree[node<<1|1];

}



int query(int node, int left, int right, int value)
{
        if (left==right) return left;
        int middle = (left+right)>>1;
        if (value <= tree[node<<1])
                return query(node<<1, left, middle, value);
        else
                return query(node<<1|1, middle+1, right, value-tree[node<<1]);
}


int main()
{

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


        fin>>n;
        for (int i = 1; i <= n; ++i)
        { 
                fin>>clasament[i];
                modify(1, 1, n, i, 1);
        }
        for (int i = n; i > 0; --i)
        {
                int place = query(1, 1, n, clasament[i]);
                result[place] = i;
                modify(1, 1, n, place, 0);
        }   
        for (int i = 1; i <= n; ++i)
                fout<<result[i]<<"\n";


        fin.close();
        fout.close();
        return 0;


}