#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#define dbg(x) (cout<<#x<<" = "<<(x)<<'\n')
#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "schi";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

typedef long long int lld;
typedef pair<int, int> PII;
typedef pair<int, lld> PIL;
typedef pair<lld, int> PLI;
typedef pair<lld, lld> PLL;

const int INF = (1LL << 31) - 1;
const lld LINF = (1LL << 62) - 1;
const int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
const int NMAX = 30000 + 5;

#define DIM 300000
char buff[DIM];
int poz = 0;

void read(int &numar) {
    numar = 0;

    while (buff[poz] < '0' || buff[poz] > '9')
        if (++poz == DIM)
            fread(buff, 1, DIM, stdin), poz = 0;

    while ('0' <= buff[poz] && buff[poz] <= '9') {
        numar = numar * 10 + buff[poz] - '0';
        if (++poz == DIM)
            fread(buff, 1, DIM, stdin), poz = 0;
    }
}

int N;
int V[NMAX];
int AIB[NMAX];
int sol[NMAX];

inline void update(int i) {
    if(i <= N) {
        AIB[i]++;
        update(i + ((-i)&i));
    }
}

inline int query(int i) {
    if(i)
        return AIB[i] + query(i - ((-i)&i));
    return 0;
}

int main() {
    int i, lo, mi, hi, p;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    read(N);

    for(i = 1; i <= N; i++)
        read(V[i]);

    for(i = N; i >= 1; i--)
        for(lo = V[i], hi = V[i] + query(N); lo <= hi; ) {
            mi = (lo + hi) / 2;

            p = query(mi) + V[i];

            if(mi == p && !sol[mi]) {
                update(mi);
                sol[mi] = i;
                break;
            } else if(mi < p)
                lo = mi + 1;
            else
                hi = mi - 1;
        }

    for(i = 1; i <= N; i++)
        printf("%d\n", sol[i]);

    return 0;
}