#include <queue>
#include <fstream>
#define now q.front()
#define x first
#define y second
#define pu pair<int,int>
using namespace std;
ifstream f("vila.in");
ofstream g("vila.out");
queue <pu> q;
int v[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;
            while(v[b])
            {
                b++;
            }
            for(b;b>=a;b--)
            {
                v[b+1]=v[b];
            }
            v[a]=i;
        }
        else
        v[a]=i;
    }
    for(i=1;i<=n;i++)
        g<<v[i]<<"\n";

return 0;
}