#include<cstdio>
#include<iostream>
#include<algorithm>

using namespace std;

#define N 100001

#define lowbit(x) x&-x

int n;
int p[N];

int c[N];

int a[N];
int dp[N],m;
int f[N];

void read(int &x)
{
    x=0; char c=getchar();
    while(!isdigit(c)) c=getchar();
    
 
while(isdigit(c)) { x=x*10+c-'0'; c=getchar(); }
}

    
void add(int pos,int x)
{
    while(pos<=n)
    {
        c[pos]+=x;
        pos+=lowbit(pos);
    }
}

int query(int x)
{
    int sum=0;
    while(x)
    {
        sum+=c[x];
        x-=lowbit(x);
    }
    return sum;
}

 
int find(int x)
{
    int l=1,r=n,mid,tmp;
    while(l<=r)
    {
        mid=l+r>>1;
        if(mid-query(mid)>=x) tmp=mid,r=mid-1;
        else l=mid+1;
    }
    return tmp;
}

void init()
{
    read(n);
    for(int i=1;i<=n;++i) read(p[i]);
    int pos;
    for(int
 
 i=n;i;--i)
    {
        pos=find(p[i]+1);
        a[pos]=i;
        add(pos,1);
    }
}

void pre_LIS()
{
    dp[m=1]=a[1];
    f[a[1]]=1;
    int pos;
    for(int i=2;i<=n;++i)
    {
        if(a[i]>dp[m]) 
        {
            dp[++m]=a[i];
            f[a[i]]=m;
        }    
        else
        {
            pos=lower_bound(dp+1,dp+m+1,a[i])-dp;
            if(a[i]<dp[pos]) dp[pos]=a[i];
            f[a[i]]=pos;
        }
    }
}


void solve()
{
    int now=0; 
    for(int i=1;i<=n;++i) 
    {
        now=max(now,f[i]);
        printf("%d\n",now);
    }
}

int main()
{
    init();
    pre_LIS();
    solve();
}