#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cctype>
#define lowbit(x) (x&-x)
using namespace std;
const int maxn=100010;
int a[maxn],b[maxn],c[maxn],g[maxn],anss[maxn],n;
int read(){char c;int s=0,t=1;while(!isdigit(c=getchar()))if(c=='-')t=-1;do{s=s*10+c-'0';}while(isdigit(c=getchar()));return s*t;
}
void insert(int x,int k){for(int i=x;i<=n;i+=lowbit(i))c[i]+=k;}
int find(int x){int now=0,ans=0;for(int i=20;i>=0;i--){now+=(1<<i);if(now<n&&ans+c[now]<x)ans+=c[now];//< nearelse now-=(1<<i);}now++;insert(now,-1);return now;
}
int max(int a,int b){return a<b?b:a;}
int main(){n=read();for(int i=1;i<=n;i++){a[i]=read();c[i]++;c[i+lowbit(i)]+=c[i];}for(int i=n;i>=1;i--)b[find(a[i]+1)]=i;int m=0;for(int i=1;i<=n;i++){int s=lower_bound(g+1,g+m+1,b[i])-g;if(s>m)g[++m]=b[i];else g[s]=b[i];anss[b[i]]=s;}for(int i=1;i<=n;i++){anss[i]=max(anss[i-1],anss[i]);printf("%d\n",anss[i]);}return 0;
}

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cctype>
using namespace std;
const int maxn=100010;
struct cyc{int l,r,rnd,num,mx,sz;}t[maxn];
int root,n;
int read(){char c;int s=0,t=1;while(!isdigit(c=getchar()))if(c=='-')t=-1;do{s=s*10+c-'0';}while(isdigit(c=getchar()));return s*t;
}
void up(int k){t[k].sz=t[t[k].l].sz+t[t[k].r].sz+1;t[k].mx=max(t[k].num,max(t[t[k].l].mx,t[t[k].r].mx));
}
void split(int k,int &l,int &r,int x){if(!k)return void(l=r=0);if(x<t[t[k].l].sz+1){r=k;split(t[k].l,l,t[k].l,x);}else{l=k;split(t[k].r,t[k].r,r,x-t[t[k].l].sz-1);}up(k);
}
int merge(int a,int b){if(!a||!b)return a^b;if(t[a].rnd<t[b].rnd){t[a].r=merge(t[a].r,b);up(a);return a;}else{t[b].l=merge(a,t[b].l);up(b);return b;}
}
void insert(int k,int x){int a,b;split(root,a,b,x);t[k]=(cyc){0,0,rand(),t[a].mx+1,t[a].mx+1,1};root=merge(a,k);root=merge(root,b);printf("%d\n",t[root].mx);
}
int main(){n=read();root=0;for(int i=1;i<=n;i++)insert(i,read());return 0;
}