#include<iostream>

#include<string.h>

#define ll long long

using namespace std;

ll a[],b[],c[],vis[];

//a[i]保存原始数据，b[i]保存比a[i]小的数的个数，c[i]保存所有比a[i]小的数的和

ll lowbit(ll x)

{

    return x&(-x);

}

ll getsum(ll x)//求比x小的数的和

{

    ll ans=;

    while(x>)

    {

        ans=ans+c[x];

        x=x-lowbit(x);

    }

    return ans;

}

void add(ll x,ll y)//更新，对第x个位置的数进行更新，y是更新值

{

    while(x<=)

    {

        b[x]=b[x]+;

        c[x]=c[x]+y;

        x=x+lowbit(x);

    }

}

int main()

{

    int n;

    while(~scanf("%d",&n))

    {

        ll ans=,sum=;

        memset(a,,sizeof(a));

        memset(b,,sizeof(b));

        memset(c,,sizeof(c));

        for(int i=;i<=n;i++)

        {

            scanf("%lld",&a[i]);

            add(i,i);//将第x个位置的值，修改为x

        }

        for(int i=n;i>=;i--)

        {

            ll le=,ri=n,mid;

            while(le<ri)//从右往左，二分枚举最大的x,使得左边小于x的所有数的和小于等于a[i]

            {

                mid=(le+ri+)/;

                if(getsum(mid-)<=a[i])

                    le=mid;

                else

                    ri=mid-;

            }

            vis[i]=le;

            add(le,-le);//枚举到这个数之后就把这个数置为零

        }

        for(int i=;i<=n;i++)

        {

            if(i==)

                printf("%lld",vis[i]);

            else

                printf(" %lld",vis[i]);

        }

        printf("\n");

    }

    return ;

}