#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>


using namespace std;

typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;

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

int main(){
    ios::sync_with_stdio(false);
    fin.tie(nullptr);
    fout.tie(nullptr);
    int n,x;
    fin>>n;
    vector<int>v(n),cf(n);
    indexed_set pl;
    for(auto &x:v)fin>>x;
    for(int i=1;i<=n;i++) pl.insert(i);
    for(int i=n-1;i>=0;i--){
        int li=v[i],ind=li-1;
        auto it=pl.find_by_order(ind);
        int pr=*it;
        cf[pr-1]=i+1;
        pl.erase(it);
    }
    for(auto x:cf) fout<<x<<'\n';
    return 0;
}