#include <queue>
#include <fstream>
#define now q.front()
#define x first
#define y second
#define pu pair<int,int>
using namespace std;
ifstream f("schi.in");
ofstream g("schi.out");
queue <pu> q;
int v[30001],p[30001],i,n,m,j,r,t,maxi,i1,i2,j1,j2,a,b,z;
int main()
{
    f>>n;
    for(i=1;i<=n;i++)
    {
        f>>a;

        if(v[a])
        {

            b=a+p[a]-1;
            for(b,r=1;b>=a;b++,r++)
            {
                v[b+1]=v[b];
                p[b+1]=r;
            }
        }
        else
        v[a]=i;p[a]++;
    }
    for(i=1;i<=n;i++)
        g<<v[i]<<"\n";

return 0;
}