#include <iostream>
#include<fstream>
#include<algorithm>
using namespace std;
int aib[30005],v[30005],a[30005],i,j,n,aux;
inline int lbit(int x)
{
    return((x^(x-1))&x);
}
void update(int x)
{
    for(j=x;j<=n;j+=lbit(j))
        aib[j]++;
        return;
}
int compute(int x)
{
    int sum=0;
    for(j=x;j>0;j-=lbit(j))
        sum+=aib[j];
    return sum;
}
bool cmp(int x,int y)
{
    if(v[x]!=v[y])return v[x]<v[y];
    return x>y;
}
int main()
{
    ifstream f("schi.in");
    ofstream g("schi.out");
    f>>n;
    for(i=1;i<=n;i++)
        f>>v[i];
    for(i=n;i>=1;i--)
    {
        aux=compute(v[i]);
        update(v[i]);
        v[i]+=aux;
    }
    for(i=1;i<=n;i++) a[i]=i;
    sort(a+1,a+n+1,cmp);
    for(i=1;i<=n;i++) g<<a[i]<<'\n';
    return 0;
}