#include <bits/stdc++.h>


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



int  main()
{
  stack <int> aux;
  deque <int> ordine;
 //cout<<ordine.size();
  int n;
  f>>n;
  for(int i=1; i<=n; i++)
  {

      int poz;
      f>>poz;
      if(ordine.empty() || (!ordine.empty() and ordine.size()<poz))
        ordine.push_back(i);
        else
      {
          while(ordine.size()>=poz)
          {
              aux.push(ordine.back());
              ordine.pop_back();
          }
          ordine.push_back(i);
          while(!aux.empty())
          {
              ordine.push_back(aux.top());
              aux.pop();
          }

      }


  }
  while(!ordine.empty())
      {
          g<<ordine.front()<<'\n';
          ordine.pop_front();

      }

    return 0;
}