#include<iostream>

#include<cstdio>

#include<cstring>

#include<string>

#include<algorithm>

#include<cctype>

#include<cmath>

#include<cstdlib>

#include<queue>

#include<ctime>

#include<vector>

#include<set>

#include<map>

#include<stack>

using namespace std;

#define int long long

int d[],n,s[],a[];

inline int lb(int x){return x&(-x);}

inline void add(int x,int k){while(x<=n)d[x]+=k,x+=lb(x);}

inline int q(int x){int res=;while(x)res+=d[x],x-=lb(x);return res;}

signed main(){

    int i,j,k;

    scanf("%lld",&n);

    for(i=;i<=n;i++)scanf("%lld",&s[i]);

    for(i=;i<=n;i++)add(i,i);

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

      int le=,ri=n,ans;

      while(ri-le>){

        int mid=(le+ri)>>;

        if(q(mid)<=s[i])le=mid;

          else ri=mid;

      }

      a[i]=ri;

      add(a[i],-a[i]);

    }

    for(i=;i<=n;i++)printf("%lld ",a[i]);

    puts("");

    return ;

}