#include <bits/stdc++.h>
#define for0(i,n) for(int i=0; i<n; i++)
#define for1(i,n) for(int i=1; i<=n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define V vector<int>
#define VP vector<pair<int, int> >
#define clr(A,x) memset(A, x, sizeof(A))
#define cpy(A,B) memcpy(A, B, sizeof(B))
#define g(s) getline(cin, s) ///ai grija la fin/cin ///
#define FASTIO ios_base::sync_with_stdio(0)
const long long INFLL = (1LL<<62);
const int INFINT = 2000000000;
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
/*template <typename T>
string to_string(const T& n){
    ostringstream os;
    os << n;
    return os.str();
}
*/

/*struct coord
{
    int x,y;

};
bool operator<(const coord &l, const coord &r)
{
    return (l.x<r.x || (l.x==r.x && l.y<r.y));
}*/

/*void invers_modular(int a, int b, int& d, int& x, int & y)
{
    if(!b)
    {
        d=a;
        x=1;
        y=0;
        return ;
    }2
    int x0, y0;
    invers_modular(b, a%b, d, x0, y0);
    x=y0;
    y=x0-a/b*y0;
} // daca x<0 se aduna cu mod pana e mai mare, x fiind rezultatul*/

/*ull p(int baze, int exponent)
{
    if(exponent==0)
        return 1;

    if(exponent%2==0)
        return p(baze*baze, exponent/2);
    else return baze*p(baze, exponent-1);
}*/
ifstream fin("schi.in"); /// modifica cu numele corespunzator
ofstream fout("rschi.out"); /// modifica cu numele corespunzator

int n;

int aib[30001];
int lsb(int x)
{
    return (x & -x);
}

void update(int pos, int val)
{
    for(int i = pos; i <= n; i += lsb(i))
        aib[i] += val;
}

int sum(int nod)
{
    int ret = 0;
    for(int i = nod; i >= 1; i -= lsb(i))
        ret += aib[i];
    return ret;
}

int caut(int val)
{
    int l = 1, r = n, mid;
    while(l < r)
    {
        mid = (l + r) / 2;
        int x = sum(mid);

        if(x < val)
            l = mid + 1;
        else r = mid;
    }
    mid = (l + r) / 2;
    if(sum(mid) < val)
        mid++;
    return mid;

}


int v[30001];
int sol[30001];

int main()
{
    fin>>n;
    for1(j, n)
        update(j, 1);

    for1(i, n)
        fin>>v[i];
    for(int j = n; j; j--)
    {
        int poz = caut(v[j]);
       // cout<<poz<<'\n';
        sol[poz] = j;
       // cout<<i<<'\n';
        update(poz, -1);
    }
    for1(i,n)
        fout<<sol[i]<<'\n';

    return 0;
}