#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template<class T> ostream& operator<<(ostream& out, vector <T> v) { return prnt(out, v); }
template<class T> ostream& operator<<(ostream& out, set <T> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, map <T1, T2> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, pair<T1, T2> p) { return out << '(' << p.st << ' ' << p.nd << ')'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"
#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define MOD 1000000007
#define zeros(x) x&(x-1)^x
#define fi first
#define se second
#define Nmax 500005
const long double PI = acos(-1);

int n,v[Nmax],AIB[Nmax],ans[Nmax];

void add(int pos, int val){
    for (;pos<=n;pos += zeros(pos)) AIB[pos] += val;
}

int find(int val){
    dbg(val);
    int p = 1, st = 0;
    for (;p<=n;p<<=1);
    for (;p>=1;p>>=1){
        dbg(st, val, AIB[st+p]);
        if (st + p <= n && AIB[st + p] < val){
            st += p;
            dbg(st);
            val -= AIB[st];
        }
    }
    return st+1;
}

int main(){
    ios::sync_with_stdio(false);
    freopen("schi.in","r",stdin);
    freopen("schi.out","w",stdout);
    cin >> n;
    for (int i=1;i<=n;i++) cin >> v[i], add(i,1);

    for (int i=n;i>=1;i--){
        int x = find(v[i]);
        ans[x] = i;
        add(x, -1);
    }

    for (int i=1;i<=n;i++){
        cout << ans[i] << '\n';
    }
    return 0;
}