#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define N  30005
#define pozitie2(x) x&(-x)
using namespace std;
ifstream f("schi.in");
ofstream g("schi.out");

int n;
int sol[N],poz[N], v[N];

int main()
{
    f >> n;

    for(int i=1; i<=n; ++i)
    {
        f >> v[i];
        poz[i] = v[i];

        int j = i-1;
        while(j>=1)
        {
            if(poz[i] <= poz[j])
                poz[j]++;
            --j;
        }

    }

    for(int i=1; i<=n; ++i)
    {
        sol[poz[i]] = i;
    }

    for (int i = 1; i <= n; ++i)
        g << sol[i] << '\n';

    return 0;
}