#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream cin("schi.in");
ofstream cout("schi.out");
vector<int> v;
int poz[30005];
struct japonia
{
    int val,poz;
};
japonia rez[30005];
bool cmp(japonia a, japonia b)
{
    return a.val<b.val;
}
int solve()
{
    int n;
    cin>>n;
    v.push_back(0);
    for(int i=1;i<=n;i++)
    {
        cin>>poz[i];
        v.push_back(i);
    }
    for(int i=n;i>=1;i--)
    {
        rez[i].val=v[poz[i]];
        rez[i].poz=i;
        v.erase(v.begin()+poz[i]);
    }
    sort(rez+1,rez+n+1,cmp);
    for(int i=1;i<=n;i++)
    {
        cout<<rez[i].poz<<'\n';
    }
    return 0;
}
int main()
{
    solve();
    return 0;
}