#include <iostream>
#include <string.h>
#include <random>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <iomanip>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <array>
#include <bitset>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <valarray>
#include <memory>
#include <cassert>
#include <chrono>
#include <type_traits>
#include <stdexcept>
#include <string_view>
#include <regex>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef pair<int, int> pii;
typedef pair<int, string> pis;
typedef pair<pis, string> piss;
typedef pair<int, short> pish;
typedef pair<string, string> pss;
typedef pair<int, char> pic;
typedef pair<pii, int> piii;
typedef pair<double, double> pdd;
typedef pair<double, int> pdi;
typedef pair<float, float> pff;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef unsigned short ushort;
typedef pair<uint, uint> puint;
typedef pair<ll, ll> pll;
typedef pair<pll, ll> plll;
typedef pair<pll, ld> plld;
typedef pair<ld, int> pldi;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ull, ull> pull;
typedef pair<ld, ld> pld;
typedef complex<double> cd;
//#define max(n, m) ((n>m)?n:m)
//#define min(n, m) ((n<m)?n:m)
#define f first
#define s second
#define input() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#define eps 1e-8
//#define eps2 1e-15
#define leni(x) sizeof(x)/sizeof(int)
#define v(i,j,k) for(i=j;i<k;i++)
//#define cin fin
//#define cout fout
//#define fin cin
//#define fout cout
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

/*

     ._________.
     |_________|
   ---------------
  |_____• U •_____|
 -------------------
|___________________|


 */

//int nums[60];
//ll dp[60][510];
//ll cnt[60];
//int main()
//{
//    input();
//    int n, sum = 0;
//    cin >> n;
//    for(int i = 0; i < n; i ++)
//        cin >> nums[i], sum += nums[i];
//    sum /= 2;
//    sum ++;
//    cout << sum << '\n';
//    memset(dp, 0, sizeof(dp));
//    for(int i = 0; i < n; i ++)
//    {
//        dp[i][0] = 1;
//        // calculate for this person
//        for(int j = 0; j < n; j ++)
//        {
//            if(i == j) continue;
//            for(int k = sum-1; k >= nums[j]; k --)
//                dp[i][k] += dp[i][k-nums[j]];
//        }
//    }
//    ll tot = 0;
//    for(int i = 0; i < n; i ++)
//    {
//        for(int k = sum-nums[i]; k < sum; k ++)
//            cnt[i] += dp[i][k];
//        tot += cnt[i];
//    }
//    for(int i = 0; i < n; i ++)
//    {
//        cout << cnt[i] << "/" << tot << ' ' << (ld)cnt[i]/(ld)tot << '\n';
//    }
//}



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

int nums[30010], ans[30010];
Tree<int> all;
int main()
{
    input();
    int n;
    fin >> n;
    for(int i = 0; i < n; i ++)
        fin >> nums[i], nums[i]--, all.insert(i+1);
    for(int i = n-1; i >= 0; i --)
    {
        int idx = *all.find_by_order(nums[i]);
        ans[idx] = i+1;
        all.erase(idx);
    }
    for(int i = 0; i < n; i ++)
        fout << ans[i] << endl;
}