#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(), (c).end()
#define rall(A) A.rbegin(),A.rend()
#define pb push_back 
#define dbg(x) do {cerr << #x <<" = " << (x) << endl; } while (false)
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
//cout << setprecision(12) << fixed;

#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#include <ext/pb_ds/detail/standard_policies.hpp>

using namespace __gnu_pbds;

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

int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    
    ifstream in; ofstream out;
    in.open("schi.in");
    out.open("schi.out");
    
    ordered_set s;

    int n; in >> n;
    int a[n];

    for(int i = 0; i < n; i++) {
        in >> a[i];
        s.insert(i);
    }
    
    int ans[n];
    for(int i = n-1; i >= 0; i--) {
        int pos = *(s.find_by_order(a[i]-1));
        s.erase(s.find(pos));
        
        ans[pos] = i;
    }

    for(int i = 0; i < n; i++)
        out << ans[i]+1 << "\n";
    
    return 0;
}