#include <fstream>

using namespace std;

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

int n;
int partial[30005];
int final[30005];

int cautare(int x)
{
    if(final[x]!=0) return x;
    return 0;
}
int main()
{
    int i,j,nr=0,x;
    in>>n;
    for(i=1;i<=n;i++) in>>partial[i];

    for(i=1;i<=n;i++)
    {
        x=cautare(partial[i]);
        if(x)
        {
            for(j=nr;j>=x;j--)
                final[j+1]=final[j];
        }
        final[partial[i]]=i;
        nr++;
    }
    for(i=1;i<=n;i++) out<<final[i]<<"\n";
    in.close();
    out.close();
    return 0;
}