#include <fstream>
#include <algorithm>
#include <iostream>

using namespace std;

ifstream f("schi.in");
ofstream g("schi.out");

struct tab
{
    int loc,p;
};

tab val[30001];
int n;

bool cmp(tab a,tab b)
{
    return a.loc < b.loc;
}

int main()
{
    f >> n;
     int x = 1;
      for (int i=1;i<=n;i++)
      {
          int l;
           f >> l;
            val[x].loc = l;
            val[x].p = i;
          for (int j=1;j<x;j++)
            if ( val[j].loc >= l )  val[j].loc++;
           x++;
      }

    sort(val+1,val+n+1,cmp);

   for (int i=1;i<=n;i++)
     g << val[i].p << "\n";

    return 0;
}